No.108 Convert Sorted Array to BST

private static class MyNode { TreeNode node; int lb; int rb; public MyNode(TreeNode n, int theLeft, int theRight) { this.node = n; this.lb = theLeft; this.rb = theRight; } } public TreeNode sortedArrayToBST2(int[] nums) { if (nums == null || nums.length == 0) { return null; } Queue queue = new LinkedList<>(); int left = 0; int right = nums.length - 1; int val = nums[left + (right - left) / 2]; TreeNode root = new TreeNode(val); queue.offer(new MyNode(root, left, right)); while (!queue.isEmpty()) { int size = queue.size(); for (int i = 0; i < size; i++) { MyNode cur = queue.poll(); int mid = cur.lb + (cur.rb - cur.lb) / 2; if (mid != cur.lb) { TreeNode leftChild = new TreeNode(nums[cur.lb + (mid - 1 - cur.lb) / 2]); cur.node.left = leftChild; queue.offer(new MyNode(leftChild, cur.lb, mid - 1)); } if (mid != cur.rb) { TreeNode rightChild = new TreeNode(nums[mid + 1 + (cur.rb - mid - 1) / 2]); cur.node.right = rightChild; queue.offer(new MyNode(rightChild, mid + 1, cur.rb)); } } } return root; }