Convert Sorted Array to Binary Search Tree

最新推荐文章于 2022-02-19 22:56:38 发布

weixin_30621959

最新推荐文章于 2022-02-19 22:56:38 发布

阅读量47

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/mrpod2g/p/4420264.html

本文介绍了一种将已排序的数组转换为高度平衡的二叉搜索树的方法。通过递归方式创建平衡二叉搜索树，确保树的高度尽可能小，从而提高搜索效率。

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

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    
    public TreeNode creatBST(int low,int high,int[] num) {
        if(low<=high) {
            int mid = (low+high)/2;
            TreeNode root = new TreeNode(num[mid]);
            root.left = creatBST(low,mid-1,num);
            root.right = creatBST(mid+1,high,num);
            return root;
        }
        else return null;
    }
    
    public TreeNode sortedArrayToBST(int[] num) {
        return creatBST(0,num.length-1,num);
    }
}