leetcode刷题之 树(25):从有序数组中构造二叉查找树

[LeetCode] Convert Sorted Array to Binary Search Tree 将有序数组转为二叉搜索树

 

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

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of everynode never differ by more than 1.

Example:

Given the sorted array: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5

 

这道题是要将有序数组转为二叉搜索树，所谓二叉搜索树，是一种始终满足左<根<右的特性，如果将二叉搜索树按中序遍历的话，得到的就是一个有序数组了。那么反过来，我们可以得知，根节点应该是有序数组的中间点，从中间点分开为左右两个有序数组，在分别找出其中间点作为原中间点的左右两个子节点，这不就是是二分查找法的核心思想么。所以这道题考的就是二分查找法，代码如下：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
        TreeNode root = binarySearch(nums, 0, nums.length - 1);
        return root;
    }
    //构建一个二分查找
    private TreeNode binarySearch(int[] nums, int l, int r){
        if(l > r)
            return null;        
        int mid = l + (r - l) / 2;
        TreeNode node = new TreeNode(nums[mid]);     //mid点作为中序遍历的头结点 
        node.left =  binarySearch(nums, l, mid - 1);//从 l 到 mid -1 选择左节点 
        node.right = binarySearch(nums, mid + 1, r);//同理
        return node;
    
    }
}