Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24 |
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class
Solution {public: TreeNode *DFS(vector<int> &num,int
left,int
right) { if(right<left) return
NULL; int
mid=(left+right)>>1; TreeNode *root=new
TreeNode(num[mid]); root->left=DFS(num,left,mid-1); root->right=DFS(num,mid+1,right); return
root; } TreeNode *sortedArrayToBST(vector<int> &num) { return
DFS(num,0,num.size()-1); }}; |
[LeetCode]Convert Sorted Array to Binary Search Tree,布布扣,bubuko.com
[LeetCode]Convert Sorted Array to Binary Search Tree
原文：http://www.cnblogs.com/Rosanna/p/3595241.html