@@ -0,0 +1,841 @@
+/**%0A * Problem Link: https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/%0A * %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        return sortedArrayToBST(nums, 0, nums.length - 1);%0A    %7D%0A    %0A    private TreeNode sortedArrayToBST(int%5B%5D nums, int start, int end) %7B%0A        if(start %3E end) return null;%0A        if(start == end) %7B%0A            return new TreeNode(nums%5Bstart%5D);%0A        %7D%0A        int mid = (start + end) / 2;%0A        TreeNode root = new TreeNode(nums%5Bmid%5D);%0A        root.left = sortedArrayToBST(nums, start, mid - 1);%0A        root.right = sortedArrayToBST(nums, mid + 1, end);%0A        return root;%0A    %7D%0A%7D%0A

Create Convert_Sorted_Array_to_Binary_Search_Tree.java