LeetCode - Convert Sorted Array to Binary Search Tree

给出一个已排序的数组，将其转化为二叉查找树（BST）。

思路：取数组中间元素为根结点的value，则数组左侧、右侧分别为BST的左子树、右子树。递归可求解。代码如下：

 1 /**
 2  * Definition for binary tree
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     TreeNode *convert(int *start, int *end)
13     {
14         if (start > end)
15             return NULL;
16         int *mid = start + (end - start)/2;
17         TreeNode *node = (TreeNode *)malloc(sizeof(TreeNode));
18         node->val = *mid;
19         node->left = convert(start, mid-1);
20         node->right = convert(mid+1, end);
21         return node;
22     }
23     TreeNode *sortedArrayToBST(vector<int> &num)
24     {
25         if (num.size() == 0)
26             return NULL;
27         return convert(&num[0], &num[num.size()-1]);
28     }
29 };

转载于:https://www.cnblogs.com/bournet/p/4123564.html

LeetCode - Convert Sorted Array to Binary Search Tree相关推荐

LeetCode: Convert Sorted Array to Binary Search Tree 解题报告
Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in ascending ord ...
[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. Hi ...
[LeetCode]Convert Sorted Array to Binary Search Tree
题目描述:(链接) Given an array where elements are sorted in ascending order, convert it to a height balanc ...
arrayfunction[LeetCode]Convert Sorted Array to Binary Search Tree
新手发帖,很多方面都是刚入门,有错误的地方请大家见谅,欢迎批评指正每日一道理灯,带有一种明亮的光,每当深夜来临,是它陪伴着你,如此默默无闻.它是平凡的,外表华丽与否,那都是一样的,珍珠点缀,水晶加 ...
Convert Sorted Array to Binary Search Tree - LeetCode
目录题目链接注意点解法小结题目链接 Convert Sorted Array to Binary Search Tree - LeetCode 注意点不要访问空结点题目要求的是平衡二叉搜 ...
【数组递归构造二叉树】LeetCode 108. Convert Sorted Array to Binary Search Tree
LeetCode 108. Convert Sorted Array to Binary Search Tree Solution1:我的答案构造二叉树利用递归 /*** Definition fo ...
LeetCode: 108. Convert Sorted Array to Binary Search Tree
题目 Given an array where elements are sorted in ascending order, convert it to a height balanced BST. ...
Convert Sorted Array to Binary Search Tree With Minimal Height
Given a sorted (increasing order) array, Convert it to create a binary tree with minimal height. Exa ...
leetcode python3 简单题108. Convert Sorted Array to Binary Search Tree
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百零八题 (1)题目英文: Given an array where elem ...

LeetCode - Convert Sorted Array to Binary Search Tree

LeetCode - Convert Sorted Array to Binary Search Tree相关推荐

最新文章

热门文章