109. Convert Sorted List to Binary Search Tree

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.

把一个List变成平衡二叉树。

代码实现

把list先变成vector就可以方便使用了。

/**
 * 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:
    __inline void BuildListTree(TreeNode* root, vector<int> nums) {
        int nlen = nums.size();
        if(!nlen)  return;
        int mid = nlen >> 1;
        root->val = nums[mid];
        TreeNode* left;
        if(mid > 0) {
            root->left = new TreeNode(0);
            BuildListTree(root->left, vector<int>(nums.begin(), nums.begin()+mid));
        }
        if(mid + 1 < nlen) {
            root->right = new TreeNode(0);
            BuildListTree(root->right, vector<int>(nums.begin() + mid + 1, nums.begin() + nlen));
        }
    }

    TreeNode* sortedListToBST(ListNode* head) {
        vector<int> res;
        while(head) {
            res.push_back(head->val);
            head = head->next;
        }
        if(!res.size()) return NULL;
        TreeNode* root = new TreeNode(0);
        BuildListTree(root, res);
        return root;
    }
};

如果这道题目写成用List构建的话，那么可以使用之前在使用的快慢指针来完成。

可以写成：

/**
 * 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) {
        if(!head) return NULL;
        if(!head->next) return new TreeNode(head->val);
        ListNode *step1 = head;
        ListNode *step2 = head->next;
        while(step2->next && step2->next->next) {
            step1 = step1->next;
            step2 = step2->next->next;
        }

        TreeNode *root = new TreeNode(step1->next->val);
        ListNode *head2 = step1->next->next;
        delete step1->next;
        step1->next = NULL;
        root->left = sortedListToBST(head);
        root->right = sortedListToBST(head2);
        return root;
    }
};