问题描述
将一个按照升序排列的有序数组,转换为一棵高度平衡二叉搜索树。一个高度平衡二叉树是指一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1。
解题思路
递归思路。选取升序排列数组里的中间值作为根节点,然后分别用medium的前/后半部分作为参数递归构建左/右子树。(如果元素个数为偶数时,那么选择右边的那个数作为中间值)
代码实现
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode sortedArrayToBST(int[] nums) {
int len = nums.length;
if(len == 0){
return null;
}
int mediumIndex = len/2;
TreeNode root = new TreeNode(nums[mediumIndex]);
//构建左子树
if(mediumIndex == 0){
root.left = null;
}else{
int[] left = new int[mediumIndex];
for(int i = 0; i < mediumIndex; i++){
left[i] = nums[i];
}
root.left = sortedArrayToBST(left);
}
//构建右子树
if(mediumIndex == len - 1){
root.right =null;
}else{
int[] right = new int[len - mediumIndex - 1];
for(int i = 0; i < len - mediumIndex - 1; i++){
right[i] = nums[i + mediumIndex + 1];
}
root.right = sortedArrayToBST(right);
}
return root;
}
}
问题描述
给定一个单链表,其中的元素按升序排序,将其转换为高度平衡的二叉搜索树。
本题中,一个高度平衡二叉树是指一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1。
解题思路
基本思路与上一题相同,采用快慢指针找到升序链表的中间节点。
代码实现
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode sortedListToBST(ListNode head) {
if(head == null){
return null;
}
ListNode slow = head, fast = head;
// 开辟新的空间存储左子树节点
ListNode left = new ListNode(0);
ListNode leftHead = left;
//先遍历找到链表的中间节点
while(fast != null && fast.next != null){
left.next = new ListNode(slow.val);
left = left.next;
slow = slow.next;
fast = fast.next.next;
}
TreeNode root = new TreeNode(slow.val);
root.left = sortedListToBST(leftHead.next);
root.right = sortedListToBST(slow.next);
return root;
}
}