{"id":"index-bounds-over-slicing-in-divide-and-conquer","text":"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.","truth_value":"IN","source":"entries/2026/06/06/convert-sorted-array-to-binary-search-tree-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"index-bounds-over-slicing-in-divide-and-conquer","truth_value":"IN","reason":"premise"}]}}