Status: IN
Divide-and-conquer solutions recurse on index bounds `(left, right)` rather than creating sublists, avoiding O(n log n) total copying and keeping space to O(log n) stack frames.
Source: entries/2026/06/06/convert-sorted-array-to-binary-search-tree-solution.md