LeetCode 109. Convert Sorted List to Binary Search Tree（二叉树）

最新推荐文章于 2020-06-03 05:27:45 发布

da_kao_la

最新推荐文章于 2020-06-03 05:27:45 发布

阅读量124

点赞数

分类专栏： LeetCode 文章标签： LeetCode Medium Java 快慢指针二叉树

本文链接：https://blog.csdn.net/da_kao_la/article/details/90681007

版权

LeetCode 专栏收录该内容

371 篇文章 0 订阅

订阅专栏

将一个有序链表转换为高度平衡的二叉搜索树，保持元素排序不变。平衡二叉树定义为每个节点的两子树高度差不超过1。采用快慢指针找到链表中间节点，以此节点作为根，分别处理左右子树，确保构造出的二叉树平衡。

摘要由CSDN通过智能技术生成

题目来源：https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/

问题描述

109. Convert Sorted List to Binary Search Tree

Medium

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

Given the sorted linked list: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

/ \

-3 9

/ /

-10 5

------------------------------------------------------------

题意

根据有序链表建立平衡二叉树。

所谓“平衡二叉树”是指空树或每个节点的左右子树高度最多相差1的二叉树。

------------------------------------------------------------

思路

快慢指针找链表中点，中点左边的链表建左子树，中点右边的链表建右子树，中点对应根节点。

注意实际代码里慢指针slow找的是中点的前一个点（因为左子树的建立需要将slow.next置空表示左链表），所以要特别注意快慢指针的写法。

------------------------------------------------------------

代码

/**
 * 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; }
 * }
 */
class Solution {
    public TreeNode sortedListToBST(ListNode head) {
        if (head == null) {
            return null;
        }
        if (head.next == null) {
            return new TreeNode(head.val);
        }
        ListNode slow = head, fast = head.next;
        while (fast != null) {
            fast = fast.next;
            if (fast != null && fast.next != null) {
                slow = slow.next;
                fast = fast.next;
            }
        }
        TreeNode root = new TreeNode(slow.next.val);
        root.right = sortedListToBST(slow.next.next);
        slow.next = null;
        root.left = sortedListToBST(head);
        return root;
    }
}