108. 将有序数组转换为二叉搜索树

108. 将有序数组转换为二叉搜索树

原题

/**
 * 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 dfs(nums,0,nums.length-1);
    }

    public TreeNode dfs(int[] nums,int lo,int hi){
        //表明无左右结点
        if(lo>hi){
            return null;
        }
        //以中点为根节点
        int mid = lo + (hi-lo)/2;
        TreeNode root = new TreeNode(nums[mid]);
        //左树递归遍历
        root.left = dfs(nums,lo,mid-1);
        //右树递归遍历mid+1,从当前根节点的下一个开始
        root.right = dfs(nums,mid+1,hi);
        return root;

    }
}