Convert Sorted List to Binary Search Tree 解法

Convert Sorted List to Binary Search Tree 解法

---

第 13 周题目
难度：Media
LeetCode题号：109

题目

Description：

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

---

思考

根据平衡二叉树的性质可知，任意结点左右包含的节点数的差不超过一
又因为数据是排好序的，所以中间数据是树的根节点
中间数据把原数据分成了两部分，分别是中间数据左右节点
所以只用再次对那两部分数据找出中间节点就行了
递归调用
结束条件是，当只有一个数据时，返回他本身
没有数据时返回NULL
代码参考leetcode上的参考答案

---

代码

/**
 * 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* sortedListToBST(ListNode* head) {
        return sortedListToBST(head, NULL);
    }
private:
    TreeNode* sortedListToBST(ListNode* head, ListNode* tail) {
        if (head == tail) {
            return NULL;
        }

        TreeNode* root;
        if (head->next == tail) {
            root = new TreeNode(head->val);
            return root;
        }

        ListNode* mid = head, * length = head;
        while (length != NULL && length->next != NULL) {
            mid = mid->next;
            length = length->next;
        }
        root = new TreeNode(mid->val);
        root->left = sortedListToBST(head, mid);
        root->right = sortedListToBST(mid->next, tail);
        return root;
    }
};