[LeetCode] Convert Sorted Array to Binary Search Tree, Solution

最新推荐文章于 2022-02-19 22:56:38 发布

原创最新推荐文章于 2022-02-19 22:56:38 发布 · 239 阅读

0 ·

CC 4.0 BY-SA版权

本文详细介绍了如何将一个元素按升序排列的数组转化为一棵高度平衡的二叉搜索树（BST）。通过递归构建树结构，确保每个节点的左子树和右子树的高度差不超过1，从而实现平衡。此过程涉及到数组操作、递归算法以及二叉搜索树的基本概念。

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

» Solve this problem

[Thoughts]

[Code]

1:       TreeNode *sortedArrayToBST(vector<int> &num) {  
2:            return BuildTree(num, 0, num.size()-1);  
3:       }  
4:       TreeNode *BuildTree(vector<int> &num, int start, int end)  
5:       {  
6:            if(start>end) return NULL;  
7:            if(start == end) return new TreeNode(num[start]);  
8:            int mid = (start+end)/2;  
9:            TreeNode *node = new TreeNode(num[mid]);  
10:           node->left = BuildTree(num, start, mid-1);  
11:           node->right = BuildTree(num, mid+1, end);  
12:           return node;  
13:       }