首页 > 其他 > 详细

[leetcode] Convert Sorted Array to Binary Search Tree

时间:2014-07-03 18:56:04      阅读:328      评论:0      收藏:0      [点我收藏+]

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

 

思路:递归实现,以中间节点作为根节点。

 

bubuko.com,布布扣
public class Solution {
    public TreeNode sortedArrayToBST(int[] num) {
        return toBST(num,0,num.length);
    }
    private TreeNode toBST(int[] num, int from, int to){
        if(to-from<=0)
            return null;
        int mid=(from+to)/2;
        TreeNode root = new TreeNode(num[mid]);
        root.left=toBST(num,from,mid);
        root.right=toBST(num,mid+1,to);
        
        return root;
    }
}
View Code

 

参考:

http://blog.csdn.net/xshengh/article/details/12705769

[leetcode] Convert Sorted Array to Binary Search Tree,布布扣,bubuko.com

[leetcode] Convert Sorted Array to Binary Search Tree

原文:http://www.cnblogs.com/jdflyfly/p/3821393.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!