递归

  1. private static TreeNode sortedArrayToBST(int[] nums, int left, int right) {
  2.     if (left > right) {
  3.         return null;
  4.     }
  6.     // always choose left middle node as a root
  7.     int p = (left + right) / 2;
  9.     // inorder traversal: left -> node -> right
  10.     TreeNode root = new TreeNode(nums[p]);
  11.     root.left = sortedArrayToBST(nums, left, p - 1);
  12.     root.right = sortedArrayToBST(nums, p + 1, right);
  13.     return root;
  14. }


如果是链表转树就先转成列表