108. Convert Sorted Array to Binary Search Tree-CSDN博客

本文链接：https://blog.csdn.net/qq_39360744/article/details/104122367

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 every node 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

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

//递归

/**
 * 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) {
        return sortedArrayToBST(nums,0,nums.length);
    }
    public TreeNode sortedArrayToBST(int[] nums, int start, int end){
        if(start == end) return null;
        int mid = (start + end) >>> 1;
        TreeNode tn = new TreeNode(nums[mid]);
        tn.left = sortedArrayToBST(nums, start, mid);
        tn.right = sortedArrayToBST(nums, mid+1, end);
        return tn;
    }
}

//dfs
//BFS