package question;

/*
 @author: Roderland
 @create: 2020年08月13日---15:55
*/
public class Question108 {
 public TreeNode sortedArrayToBST(int[] nums) {
 return bfs(nums, 0, nums.length-1);
 }

 public TreeNode bfs(int[] nums, int left, int right) {
 if (left>right) return null;
 int mid = (right+left)/2;
 TreeNode root = new TreeNode(nums[mid]);
 root.left = bfs(nums, left, mid-1);
 root.right = bfs(nums, mid+1, right);
 return root;
 }
}

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

 public TreeNode() {
 }

 TreeNode(int x) {
 val = x;
 }

 public TreeNode(int val, TreeNode left, TreeNode right) {
 this.val = val;
 this.left = left;
 this.right = right;
 }

 @Override
 public String toString() {
 return "TreeNode{" +
 "val=" + val +
 '}';
 }
}