LeetCode 108 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 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

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */

首先所谓的树形结构，在JAVA中，树形结构的特征就是对于某个父节点，若存在对应的左右子节点，则左子节点的值必须小于父节点的值而右子节点的值需要大于父节点的值。因此这里的思路就是首先确定一个根节点然后通过递归或者迭代的方式生成每一个子节点。因为这里是将一组已经排好序的数组（由大到小）作为输入，这里我们可以将数组中间的值作为根节点然后以根节点对应的数组下标为分隔，将左右两边重新截断成为新的数组依次循环或者迭代最终将数组转为树形结构。

class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
        if (nums == null || nums.length == 0){ //当当前数组不包含任何元素则返回null
            return null;
        }
        int middle = nums.length / 2; //获取数组中间的index
        TreeNode root = new TreeNode(nums[middle]); //将上面的index对应的数组值作为根节点
        root.left = sortedArrayToBST(Arrays.copyOfRange(nums, 0, middle)); //递归根节点左边的节点
        root.right = sortedArrayToBST(Arrays.copyOfRange(nums, middle + 1, nums.length)); //递归根节点右边的节点
        return root;
    }
}