leedcode做题总结，题目Convert Sorted Array to Binary Search Tree 2013/02/18
2014-07-20 14:53
369 查看
将有序数组转换为二叉搜索树，这个题也比较常规，求出数组的中点当节点，然后分别对前后两半段求递归
public TreeNode sortedBST(int[] num,int i, int j) {
if(i>j)return null;
int min = (i+j)/2;
TreeNode a = new TreeNode(num[min]);
a.left=sortedBST(num,i,min-1);
a.right=sortedBST(num,min+1,j);
return a;
}
public TreeNode sortedArrayToBST(int[] num) {
int len = num.length;
return sortedBST(num,0,len-1);
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode做题总结，题目Convert Sorted List to Binary Search Tree 2012/10/02
- CODE 25: Convert Sorted Array to Binary Search Tree
- [leet code] Convert Sorted Array to Binary Search Tree
- lintcode convert-sorted-array-to-binary-search-tree-with-minimal-height 把排序数组转换为高度最小的二叉搜索树
- LintCode: Convert Sorted Array to Binary Search Tree With Minimal Height
- leecode 解题总结：108. Convert Sorted Array to Binary Search Tree
- convert-sorted-array-to-binary-search-tree Java code
- LeeCode No.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
- 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
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- [Leetcode 32] 108 Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree