问题描述:
给一个排序数组(从小到大),将其转换为一棵高度最小的排序二叉树。
样例:
给出数组 [1,2,3,4,5,6,7]
, 返回
4
/ \
2 6
/ \ / \
1 3 5 7
解题思路:
用二分法将数组二分,递归构建一棵树,这样能保证深度最小。
代码:
/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param A: A sorted (increasing order) array
* @return: A tree node
*/
void SortedArrayToBST(TreeNode *root1, vector<int> &A, int start, int end) {
if (start> end) return;
int mid= (start+end)/2;
root1->val= A[mid];
if (start<= (mid-1)) root1->left=new TreeNode(0);
SortedArrayToBST(root1->left , A, start, mid-1);
if ((mid+1) <= end) root1->right= new TreeNode(0);
SortedArrayToBST(root1->right, A, mid+1, end);
}
TreeNode *sortedArrayToBST(vector<int> &A) {
// write your code here
if (A.empty()) return NULL;
int start = 0, end= A.size()-1;
int mid= (start+end)/2;
TreeNode *root=new TreeNode(0);
SortedArrayToBST(root, A, start, end);
return root;
}
};
感想:
将二分的思想构建二叉树,跟中序遍历一样。