题目链接:https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/
题目描述:
将一个按照升序排列的有序数组,转换为一棵高度平衡二叉搜索树。
本题中,一个高度平衡二叉树是指一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1。
示例:
给定有序数组: [-10,-3,0,5,9],
一个可能的答案是:[0,-3,9,-10,null,5],它可以表示下面这个高度平衡二叉搜索树:
0
/ \
-3 9
/ /
-10 5
解法一
递归。时间复杂度:O(n),n是数组长度,每个数字访问一次。
空间复杂度:O(logn),考虑递归深度,递归栈的深度为logn。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode sortedArrayToBST(int[] nums) {
return helper(nums , 0 , nums.length-1);
}
public TreeNode helper(int[] nums , int left , int right) {
if(left > right) {
return null;
}
int mid =(left + right + 1)/2;
TreeNode root = new TreeNode(nums[mid]);
root.left = helper(nums , left , mid-1);
root.right = helper(nums , mid+1 , right);
return root;
}
}
解法二
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode sortedArrayToBST(int[] nums) {
if(nums.length == 0) {
return null;
}
Queue<int[]> rangeQueue = new LinkedList<>();
Queue<TreeNode> nodeQueue = new LinkedList<>();
int left = 0;
int right = nums.length-1;
int mid = (left+right+1) >> 1;
TreeNode root = new TreeNode(nums[mid]);
rangeQueue.add(new int[] {left,mid-1});
rangeQueue.add(new int[] {mid+1,right});
//这个节点两次入队列,一次出队列确定左孩子,一次出队列确定右孩子。
nodeQueue.add(root);
nodeQueue.add(root);
while(!rangeQueue.isEmpty()) {
int[] range = rangeQueue.poll();
TreeNode currentNode = nodeQueue.poll();
left = range[0];
right = range[1];
if(left>right) {
continue;
}
mid = (left+right+1) >> 1;
int midValue = nums[mid];
TreeNode newNode = new TreeNode(midValue);
if(midValue<currentNode.val) {
currentNode.left = newNode;
}
else {
currentNode.right = newNode;
}
if(left<right) {
rangeQueue.add(new int[] {left,mid-1});
rangeQueue.add(new int[] {mid+1,right});
nodeQueue.add(newNode);
nodeQueue.add(newNode);
}
}
return root;
}
}