本文共 847 字，大约阅读时间需要 2 分钟。

/** * Definition for a binary tree node. * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode() {} *     TreeNode(int val) { this.val = val; } *     TreeNode(int val, TreeNode left, TreeNode right) { *         this.val = val; *         this.left = left; *         this.right = right; *     } * } */class Solution {
       public TreeNode sortedArrayToBST(int[] nums) {
           return help(nums, 0, nums.length - 1);    }    public TreeNode help(int[] arr, int left, int right) {
           //采用二分法  取中间的一个元素作为根节点 这样可以保证高度差不超过一        if(left > right) {
               return null;        }        int mid = left + (right - left) / 2;        TreeNode root = new TreeNode(arr[mid]);        root.left = help(arr, left, mid - 1);        root.right = help(arr, mid + 1, right);        return root;    }}

转载地址：http://zmhzi.baihongyu.com/