leetcode108 有序数组转换成二叉搜索树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    TreeNode root=null;
    public TreeNode sortedArrayToBST(int[] nums) {
        int length=nums.length;
        BST(nums,0,length-1);
        return root;


    }
    public void BST(int[] nums,int left,int right){
        if(left<=right){
             int mid=(left+right)/2; //把中间的作为根节点，然后分成左右，继续递归
             insert(nums[mid]);
             BST(nums,left,mid-1);
             BST(nums,mid+1,right);
        }

    }
    public void insert(int val){
        TreeNode node=new TreeNode(val);
        if(root==null)
            root= node;
        else{
            TreeNode current=root;
            TreeNode parent;
            while(true){
                parent=current;
                if(val<parent.val){
                    current=parent.left;
                    if(current==null)
                    {
                        parent.left=node;
                        return;
                    }
                }
                else{
                    current=parent.right;
                    if(current==null)
                    {
                        parent.right=node;
                        return;
                    }

                }


            }
        }
    }
}