Convert Sorted Array to Binary Search Tree
来源:互联网 发布:股票预测软件破解 编辑:程序博客网 时间:2024/05/29 16:55
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
将增序数组转换为左右均衡的二叉查找树 根据查找树的性质 左子树所有节点小于根节点值 右边都大于根节点值 子树也遵循此性质 所以只要取出增序数组的中间值作为根节点 再将左右子数组进行递归 代码如下:
public class Solution { public TreeNode sortedArrayToBST(int[] num) { if(num.length==0)return null;TreeNode root=new TreeNode(num[num.length/2]);int[] leftnum=new int[num.length/2];for(int i=0;i<num.length/2;i++){leftnum[i]=num[i];}root.left=sortedArrayToBST(leftnum);int[] rightnum=new int[num.length-num.length/2-1];for(int i=0;i<num.length-num.length/2-1;i++){rightnum[i]=num[num.length/2+i+1];}root.right=sortedArrayToBST(rightnum);return root; }}
0 0
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- 如何优雅的管理游戏资源
- View.VISIBLE、INVISIBLE、GONE的区别
- Best Time to Buy and Sell Stock III
- gluLookAt
- 软件开发和团队”最小模式”初探2-6人模型
- Convert Sorted Array to Binary Search Tree
- 提升工作效率的软件(大众版) by Mr. Niebieski
- Eclipse设置编辑器中的字体为Courier New
- 【算法导论】中位数和顺序统计量之选择算法
- 文本框输入监控事件
- OCILIB使用事务
- 实验五:树和二叉树实验——信管1134--05
- Apache commons exec 简介和简单ping命令方法调用实现
- 如何显示光流图 opencv