题目链接
注意点
解法
小结

题目链接

Convert Sorted Array to Binary Search Tree - LeetCode

注意点

不要访问空结点
题目要求的是平衡二叉搜索树（也就是AVL树）

解法

解法一：递归，二叉搜索树的中序遍历结果刚好是一个有序数组，有序数组中间的数字刚好是根节点，因此可以用二分的思想来做。

/*** Definition for a binary tree node.* struct TreeNode {*     int val;*     TreeNode *left;*     TreeNode *right;*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}* };*/
class Solution {
public:TreeNode* sortedArrayToBST(vector<int>& nums) {return sortedArrayToBST(nums,0,nums.size()-1);}TreeNode* sortedArrayToBST(vector<int>& nums,int left,int right) {if(left > right) return NULL;int mid = left+(right-left)/2;TreeNode* node = new TreeNode(nums[mid]);node->left = sortedArrayToBST(nums,left,mid-1);node->right = sortedArrayToBST(nums,mid+1,right);return node;}
};

小结

avl的子树高度差不超过1

转载于:https://www.cnblogs.com/multhree/p/10564856.html

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: 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: 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] 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 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
题目描述:(链接) Given an array where elements are sorted in ascending order, convert it to a height balanc ...
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 ...
【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. 题解 ...

Convert Sorted Array to Binary Search Tree - LeetCode

题目链接

注意点

解法

小结

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

最新文章

热门文章