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

 

代码：

和上一题类似，只是将排序好的数组换成链表，要处理好链尾和头指针为空的情况。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* inorderBST(ListNode* head, ListNode* tail) {
        if(head == tail)
        {
            return NULL;
        }
        ListNode *mid = head, *last = head;
        while(last != tail && last->next != tail)
        {
            mid = mid->next;
            last = last->next->next;
        }
        TreeNode* root = new TreeNode(mid->val);
        root->left = inorderBST(head, mid);
        root->right = inorderBST(mid->next, tail);
        return root;
    }
    TreeNode* sortedListToBST(ListNode* head) {
        if(head == NULL)
            return NULL;
        TreeNode* root = inorderBST(head, NULL);
        return root;
    }
};

又是一次AC，并且优于99.88% 哈哈哈~ 不要膨胀，继续加油！