(java) Convert Sorted Array to Binary Search Tree
来源:互联网 发布:low pass filter 算法 编辑:程序博客网 时间:2024/06/04 20:11
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
思路:建立一个平衡的二叉搜索树,我们可以以中位数为根,比它小的的是它的左子树,比它大的是它的右子树,将左右子树已同样的方法进行下去,直到左右均没有节点为止
代码如下(已通过leetcode)
public class Solution {
public TreeNode sortedArrayToBST(int[] nums) {
if(nums.length==0) return null;
TreeNode root=createAVLBST(0,nums.length-1,nums);
return root;
}
private TreeNode createAVLBST(int low, int high, int[] nums) {
// TODO Auto-generated method stub
if(low==high) return new TreeNode(nums[low]);
else {
if(low>high) return null;
else{
int mid=(low+high)/2;
TreeNode temp=new TreeNode(nums[mid]);
temp.left=createAVLBST(low, mid-1, nums);
temp.right=createAVLBST(mid+1, high, nums);
return temp;
}
}
}
}
- 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
- Struts2 图片上传 hibernate保存图片于数据库 。。
- ZooKeeper 笔记(4) 实战应用之【消除单点故障】
- c语言学习笔记--初识c
- web service中chain的使用
- 安装mysql-5.7.11-winx64.zip 版本, 启动服务 遇 3534 错误的解决方法
- (java) Convert Sorted Array to Binary Search Tree
- linux命令总结
- const
- POJ 3009 DFS+剪枝
- hash学习笔记
- 7行核心代码对任何数据进行军事级别的加密或解密
- 项目--Combobox使用小结
- JVM 内存 (堆(heap)、栈(stack)和方法区(method) )
- Android开发教程(二)