108. Convert Sorted Array to Binary Search Tree

来源:互联网 发布:python 结巴分词 编辑:程序博客网 时间:2024/04/28 01:20
/** * Definition for a binary tree node. * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode(int x) { val = x; } * } */public class Solution {    public TreeNode sortedArrayToBST(int[] nums) {        if(nums == null || nums.length == 0){            return null;        }        return helper(nums, 0, nums.length-1);    }        public TreeNode helper(int[] nums, int i, int j){        if(i>j){            return null;        }        int m = i + (j-i)/2;        TreeNode node = new TreeNode(nums[m]);        node.left = helper(nums, i, m-1);        node.right = helper(nums, m+1, j);        return node;    }}