[LeetCode] 108. Convert Sorted Array to Binary Search Tree

原题链接：https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/

1. 题目介绍

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.

给出升序排列的数组，将其转化成一棵平衡二叉搜索树。
对于本题来说，一个平衡二叉树的意思是，该树每一个节点的左右子树高度相差不超过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,null,5],也就是下面这棵树：

2. 解题思路

平衡二叉搜索树的左子树和右子树的高度相差不超过1。
题目给出的数组是已经排好序的，为了保持左右子树高度差尽可能小，可以选择数组最中间的数作为根节点，然后将数组分为左子树部分和右子树部分，之后再分别递归求解左子树部分和右子树部分的根节点。
实现代码

/**
 * 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 helper(0, nums.length -1, nums);
    }
    public TreeNode helper(int l , int r, int[] nums){
        if(l > r){
            return null;
        }
        int mid = (l + r)/2;
        TreeNode node = new TreeNode(nums[mid]);
        node.left = helper(l , mid-1, nums);
        node.right = helper(mid+1 , r, nums);
        return node;
    }
}