@@ -0,0 +1,652 @@
+/**%0A * Definition for binary tree%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 num) %7B%0A        return createBST(num, 0, num.length-1);%0A    %7D%0A    %0A    private TreeNode createBST(int %5B%5D num, int start, int end) %7B%0A        if (start%3Eend) %7B%0A            return null;%0A        %7D%0A        int mid = (start+end)/2;%0A        %0A        TreeNode node = new TreeNode(num%5Bmid%5D);%0A        node.left = createBST(num, start, mid-1);%0A        node.right = createBST(num, mid+1, end);%0A        %0A        return node;%0A    %7D%0A%7D%0A

Create Convert_Sorted_Array_to_Binary_Search_Tree.java