本文旨在对于个人知识的梳理以及知识的分享,如果有不足的地方,欢迎大家在评论区指出
题目描述
给定一个有序整数数组,元素各不相同且按升序排列,编写一个算法,创建一棵高度最小的二叉搜索树。
示例:
给定有序数组: [-10,-3,0,5,9],
一个可能的答案是:[0,-3,9,-10,null,5],它可以表示下面这个高度平衡二叉搜索树:
0
/ \
-3 9
/ /
-10 5
题目链接
题目分析
这道题要求的是一个最小的二叉树,经过思考,我们可以发现其实也就是在构造一个平衡二叉树,也就是左右子树的高度的绝对值差不超过1,所以每一次我们都从数组的中点将它分为两半,然后递归的去构造左子树与右子树,这样就可以将树构建出来了
解题代码
python:
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def sortedArrayToBST(self, nums: List[int]) -> TreeNode:
def construct(nums, l, r):
if l > r:
return None
mid = l + r >> 1
root = TreeNode(nums[mid])
root.left = construct(nums, l, mid-1)
root.right = construct(nums, mid+1, r)
return root
return construct(nums, 0, len(nums)-1)
Java:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
private TreeNode construct(int[] nums, int l, int r){
if(l > r) return null;
int mid = l + r >> 1;
TreeNode root = new TreeNode(nums[mid]);
root.left = construct(nums, l, mid-1);
root.right = construct(nums, mid+1, r);
return root;
}
public TreeNode sortedArrayToBST(int[] nums) {
int n = nums.length;
return construct(nums, 0, n-1);
}
}