@@ -0,0 +1,815 @@
+package leetcode.convert_sorted_array_to_binary_search_tree;%0A%0Aimport common.TreeNode;%0A%0Apublic class Solution %7B%0A%09public TreeNode sortedArrayToBST(int%5B%5D num, int from, int to) %7B%0A%09%09if(from == to) return null;%0A%09%09TreeNode root;%0A%09%09int mid = from + (to - from) / 2;%0A%09%09root = new TreeNode(num%5Bmid%5D);%0A%09%09root.left = sortedArrayToBST(num, from, mid);%0A%09%09root.right = sortedArrayToBST(num, mid + 1, to);%0A%09%09return root;%0A%09%7D%0A%0A%09public TreeNode sortedArrayToBST(int%5B%5D num) %7B%0A        if(num == null) return null;%0A        return sortedArrayToBST(num, 0, num.length);%0A    %7D%0A%09%0A%09public static void inOrder(TreeNode node)%7B%0A%09%09if(node != null)%7B%0A%09%09%09inOrder(node.left);%0A%09%09%09System.err.print(node.val + %22 %22);%0A%09%09%09inOrder(node.right);%0A%09%09%7D%0A%09%7D%0A%09%0A%09public static void main(String%5B%5D args)%7B%0A%09%09inOrder(new Solution().sortedArrayToBST(new int%5B%5D%7B%7D));%0A%09%7D%0A%7D%0A

Add java solution for 108. Convert Sorted Array to Binary Search Tree