@@ -0,0 +1,680 @@
+public class TreeNode %7B%0A    int val;%0A    TreeNode left;%0A    TreeNode right;%0A    TreeNode(int x) %7B val = x; %7D%0A%7D%0A%0Aclass Solution %7B%0A    public TreeNode sortedArrayToBST(int%5B%5D nums) %7B%0A        if (nums.length == 0) %7B%0A            return null;%0A        %7D        %0A        TreeNode root = helper(nums, 0, nums.length - 1);%0A        return root;%0A    %7D%0A%0A    private TreeNode helper(int%5B%5D nums, int low, int high) %7B%0A        if (low %3E high) %7B%0A            return null;%0A        %7D%0A        int mid = low + (high - low) / 2;%0A        TreeNode root = new TreeNode(nums%5Bmid%5D);%0A        root.left = helper(nums, low, mid - 1);%0A        root.right = helper(nums, mid + 1, high);%0A        return root;%0A    %7D%0A%7D

108. Convert Sorted Array to Binary Search Tree