【Leetcode】Convert Sorted Array to Binary Search Tree
2015-11-21 09:07
288 查看
题目链接:https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/
题目:
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
思路:
新建一个结点保存mid值,该结点的左右子树也递归生成,这是个常用的模板
算法:
题目:
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
思路:
新建一个结点保存mid值,该结点的左右子树也递归生成,这是个常用的模板
算法:
public TreeNode sortedArrayToBST(int[] nums) { if (nums == null || nums.length == 0) { return null; } return test(nums, 0, nums.length - 1); } public TreeNode test(int[] nums, int left, int right) { if (right < left) return null; int mid = (left + right) / 2; TreeNode root = new TreeNode(nums[mid]); root.left = test(nums, left, mid - 1); root.right = test(nums, mid + 1, right); return root; }
相关文章推荐
- Android之禁止GridView上下滑动
- Android 中如何启动计时器线程
- 收藏——android SDK下载失败和更新方法
- 【Leetcode】Populating Next Right Pointers in Each Node
- QT显示图片
- CF-599B - Spongebob and Joke
- [BZOJ2060] [Usaco2010 Nov]Visiting Cows 拜访奶牛
- UISearchBar介绍
- 黑魔法师之门
- 如何跨控制器跳转 iOS 返回到上上级控制器
- Win10设置应用搜索框中输入文字搜索不到的解决办法
- Noip2015总结
- Android textAppearance的属性设置及TextView属性详解
- 传值与传址
- 谢惠民,恽自求,易法槐,钱定边编数学分析习题课讲义习题参考解答
- 0017.包、类、对象、成员的访问权限
- 谢惠民,恽自求,易法槐,钱定边编数学分析习题课讲义23.2.3练习题参考解答[来自陶哲轩小弟]
- 【Leetcode】Binary Tree Inorder Traversal
- 休息2天
- HDU 1754 I Hate It