题目

原始地址：https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/#/description

/*** Definition for singly-linked list.* public class ListNode {*     int val;*     ListNode next;*     ListNode(int x) { val = x; }* }*/
/*** Definition for a binary tree node.* public class TreeNode {*     int val;*     TreeNode left;*     TreeNode right;*     TreeNode(int x) { val = x; }* }*/
public class Solution {public TreeNode sortedListToBST(ListNode head) {}
}

描述

给定一个按照升序排序的单链表，将它转换成一个高度平衡的二叉搜索树。

分析

如果要保持二叉搜索树高度平衡，那么要求插入的顺序和二叉树按层遍历的顺序是一致的，也即每次都找到链表的中间节点并插入，并将中间节点的两侧分成两个子链表分别转换成中间节点的左右子树，如此递归进行。

解法

/*** Definition for singly-linked list.* public class ListNode {*     int val;*     ListNode next;*     ListNode(int x) { val = x; }* }*/
/*** Definition for a binary tree node.* public class TreeNode {*     int val;*     TreeNode left;*     TreeNode right;*     TreeNode(int x) { val = x; }* }*/
public class Solution {public TreeNode sortedListToBST(ListNode head) {return insertNode(head, null);}private TreeNode insertNode(ListNode head, ListNode tail) {if (head == null || head == tail) {return null;}ListNode fast = head, slow = head;while (fast != tail && fast.next != tail) {fast = fast.next.next;slow = slow.next;}TreeNode root = new TreeNode(slow.val);root.left = insertNode(head, slow);root.right = insertNode(slow.next, tail);return root;}
}

转载于:https://www.cnblogs.com/fengdianzhang/p/6826770.html

109. Convert Sorted List to Binary Search Tree相关推荐

【链表递归构造二叉树】LeetCode 109. Convert Sorted List to Binary Search Tree
LeetCode 109. Convert Sorted List to Binary Search Tree Solution1:我的答案偷鸡摸狗的做法 /*** Definition for s ...
LeetCode: 109. Convert Sorted List to Binary Search Tree
题目 Given a singly linked list where elements are sorted in ascending order, convert it to a height b ...
【leetcode】109. Convert Sorted List to Binary Search Tree
题目如下: Given a singly linked list where elements are sorted in ascending order, convert it to a heigh ...
LeetCode 109. Convert Sorted List to Binary Search Tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height bala ...
Convert Sorted Array to Binary Search Tree - LeetCode
目录题目链接注意点解法小结题目链接 Convert Sorted Array to Binary Search Tree - LeetCode 注意点不要访问空结点题目要求的是平衡二叉搜 ...
leetcode -day19 Convert Sorted List to Binary Search Tree
1. Convert Sorted List to Binary Search Tree Given a singly linked list where elements are sorted ...
LeetCode: Convert Sorted Array to Binary Search Tree 解题报告
Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in ascending ord ...
【数组递归构造二叉树】LeetCode 108. Convert Sorted Array to Binary Search Tree
LeetCode 108. Convert Sorted Array to Binary Search Tree Solution1:我的答案构造二叉树利用递归 /*** Definition fo ...
[LeetCode] Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. Hi ...

109. Convert Sorted List to Binary Search Tree

题目

描述

分析

解法

109. Convert Sorted List to Binary Search Tree相关推荐

最新文章

热门文章