109. Convert Sorted List to Binary Search Tree

Problem:

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

Analysis:

本题中提供的链表是有序的，将其转换为平衡二叉树的时候需要注意先找到序列的中点，即数的根节点，然后递归再进行生成其子节点。本题使用了两个指针，一个每次走两步，一个每次走一步，这样当第一个快节点到达链表的最后子节点，慢节点也就到达了链表的中间节点。这时只需要在递归生成树的左右子树即可。代码如下：

Code:

/**
 * 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 slowNode = head, fastNode = head, preNode = slowNode;
        while(fastNode != null && fastNode.next != null) {
            preNode = slowNode;
            slowNode = slowNode.next;
            fastNode = fastNode.next.next;
        }
        ListNode middle = slowNode;
        preNode.next = null;
        TreeNode res = new TreeNode(middle.val);
        res.left = sortedListToBST(head);
        res.right = sortedListToBST(middle.next);
        
        return res;
    }
}