leetcode--Convert Sorted Array to Binary Search Tree
来源:互联网 发布:ubuntu apache2 php 编辑:程序博客网 时间:2024/05/17 01:20
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
题意:给定一个升序排列的数组,将它转换成平衡二叉树。
平衡二叉树是指它是一棵空树或它的左右两个子树的高度差的绝对值不超过1,并且左右两个子树都是一棵平衡二叉树。
另外平衡二叉树还是排序二叉树BST的特例。
解法1:递归创建。将数组平分长两部分,减一(根节点占一位)以后是奇数也没有关系,因为平衡二叉树允许高度值差1.
对这两部分,再递归调用生成平衡二叉树,最后将左右子树连接到根节点就可以了
递归出口是只有一个数的时候,返回节点本身
原文链接http://blog.csdn.net/crazy__chen/article/details/46484423
阅读全文
0 0
- 【LeetCode】Convert Sorted Array to Binary Search Tree && Convert Sorted List to Binary Search Tree
- 【LeetCode】convert-sorted-link-to-binary-search-tree & convert-sorted-array-to-binary-search-tree
- Leetcode - Tree - Convert Sorted Array to Binary Search Tree
- *(leetcode) Convert Sorted Array to Binary Search Tree (tree)
- LeetCode[Tree]: Convert Sorted Array to Binary Search Tree
- LeetCode: Convert Sorted Array to Binary Search Tree
- [LeetCode]Convert Sorted Array to Binary Search Tree
- LeetCode Convert Sorted Array to Binary Search Tree
- [Leetcode] Convert Sorted Array to Binary Search Tree
- leetcode 11: Convert Sorted Array to Binary Search Tree
- Leetcode: Convert Sorted Array to Binary Search Tree
- [LeetCode] 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 Convert Sorted Array to Binary Search Tree
- [LeetCode]Convert Sorted Array to Binary Search Tree
- [Leetcode]Convert Sorted Array to Binary Search Tree
- [leetcode]Convert Sorted Array to Binary Search Tree
- Spring Ioc的基本原理及XML实现方法(下)
- [LeetCode] 583. Delete Operation for Two Strings
- 顺序表的简单实现
- Eclipse常用快捷键
- html5调用摄像头使用Getusermedia和canvas
- leetcode--Convert Sorted Array to Binary Search Tree
- win7环境下离线安装tensorflow
- XML格式数据与JSON格式数据学习笔记
- Java中匿名内部类总结
- 魔法练习
- 常用公共DNS
- G
- 剑指offer-08:旋转数组的最小数字
- log4j 的使用详解