二叉排序树

public class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;

    TreeNode(int x,TreeNode left,TreeNode right) {
        val = x;
        this.left=left;
        this.right=right;
    }
}
public TreeNode ArrayToTREE(int[] nums) {

        TreeNode root = new TreeNode(nums[0], null, null);

        for (int i = 1; i < nums.length; i++) {
            TreeNode temp = root;
            while (true) {
                if (nums[i] <= temp.val) {
                    if (temp.left == null) {
                        temp.left = new TreeNode(nums[i], null, null);
                        break;
                    } else {
                        temp = temp.left;
                    }
                } else {
                    if (temp.right == null) {
                        temp.right = new TreeNode(nums[i], null, null);
                        break;
                    } else {
                        temp = temp.right;
                    }
                }
            }

        }
        return root;
    }