[LeetCode] Convert Sorted Array to Binary Search Tree

문제

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

Given the sorted array: [-10,-3,0,5,9], One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST: 0 / \ -3 9 / / -10 5

 

Approach

Sorting된 배열이므로 배열의 중앙값이 BST의 루트가 되고

이를 기준으로 왼쪽이 왼쪽 서브트리, 오른쪽이 오른쪽 서브트리가 된다.

그러므로 왼쪽 오른쪽을 다시 재귀를 통해 BST를 만들어 주면 됨

 

Code

https://github.com/chi3236/algorithm/blob/master/LeetCode_ConvertSortedArrayToBinarySearchTree.cpp

chi3236/algorithm