Leetcode-108. Convert Sorted Array to Binary Search Tree
来源：互联网 发布：计算机网络就业 知乎 编辑：程序博客网 时间：2024/05/19 16:20
题目
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
给定一个排序的数组，返回二叉排序树
思路
递归建立树即可
代码
class Solution {public: TreeNode* sortedArrayToBST(vector<int>& nums) { return reBuiled(nums, 0, nums.size()-1); } TreeNode* reBuiled(vector<int>& nums, int begin, int end) { if(begin > end) return NULL; int mid = (begin + end)/2; TreeNode *root = new TreeNode(nums[mid]); root->left = reBuiled(nums, begin, mid-1); root->right = reBuiled(nums, mid+1, end); return root; }}; 0 0
- LeetCode 108. Convert Sorted Array to Binary Search Tree
- [LeetCode]108.Convert Sorted Array to Binary Search Tree
- 108. Convert Sorted Array to Binary Search Tree Leetcode Python
- [Leetcode] 108. Convert Sorted Array to Binary Search Tree
- LeetCode --- 108. Convert Sorted Array to Binary Search Tree
- [leetcode] 108.Convert Sorted Array to Binary Search Tree
- LeetCode 108. Convert Sorted Array to Binary Search Tree
- 108. 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
- [leetcode] 108. Convert Sorted Array to Binary Search Tree
- Leetcode 108. Convert Sorted Array to Binary Search Tree
- leetCode 108. Convert Sorted Array to Binary Search Tree JAVA
- LeetCode *** 108. Convert Sorted Array to Binary Search Tree
- leetcode 108. Convert Sorted Array to Binary Search Tree
- leetcode 108. Convert Sorted Array to Binary Search Tree
- LeetCode - 108. Convert Sorted Array to Binary Search Tree
- 【LeetCode】108. Convert Sorted Array to Binary Search Tree
- 如何用abaqus建造8号槽钢并分析槽钢的受力
- Linux下mariadb的使用
- （转）机会还是陷阱：诺亚财富的私募股权策略
- JS中的变量提升
- 问题总结
- Leetcode-108. Convert Sorted Array to Binary Search Tree
- HDU 1232 畅通工程
- LinkedList集合
- Chinese Girls' Amusement
- tomcat热部署
- php环境搭建
- $(window).width()与window.innerWidth的区别
- 初步了解java中的import和package
- Spark快速开始
