@@ -0,0 +1,659 @@
+/**%0A * Definition for a binary tree node.%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode(int x) %7B val = x; %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    public TreeNode sortedArrayToBST(int%5B%5D nums) %7B%0A        if(nums.length == 0)%7B%0A            return null;%0A        %7D%0A        if(nums.length == 1)%7B%0A            return new TreeNode(nums%5B0%5D);%0A        %7D%0A        TreeNode tmp = new TreeNode(nums%5Bnums.length/2%5D);%0A        tmp.left = sortedArrayToBST(Arrays.copyOfRange(nums, 0, nums.length/2));%0A        tmp.right = sortedArrayToBST(Arrays.copyOfRange(nums, nums.length/2 + 1, nums.length));%0A        return tmp;%0A    %7D%0A%7D

Q108 Convert Sorted Array to Binary Search Tree