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 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:

      0
     / \
   -3   9
   /   /
 -10  5

题目大意：

将双向链表转化为高度平衡的二叉树。

解法：

递归的求解，每次使用快慢指针寻找找双向链表的中点，并新建一个二叉树节点，然后递归的求解树的左右节点，函数中的tail参数是不能取到的节点。

java:

class Solution {
    private TreeNode toBST(ListNode head, ListNode tail){
        ListNode slow=head;
        ListNode fast=head;
        if (head == tail) return null;
        while (fast != tail && fast.next !=tail){
            fast = fast.next.next;
            slow=slow.next;
        }
        TreeNode node=new TreeNode(slow.val);
        node.left=toBST(head,slow);
        node.right=toBST(slow.next,tail);

        return node;
    }

    public TreeNode sortedListToBST(ListNode head) {
        if (head == null) return null;
        return toBST(head, null);
    }
}

原文地址：https://www.cnblogs.com/xiaobaituyun/p/11045260.html