【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

这道题跟上一道题108. Convert Sorted Array to Binary Search Tree基本一致，只不过把数组换成了链表。所以这道题将链表转成数组，做法就跟108题一样了。

有序的数组，中间元素作为根节点，中间节点的左半部分创建左子树，右半部分创建右子树，递归调用。

/**
 * 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) {
        TreeNode* res;
        vector<int> nums;
        while(head!=NULL){
            nums.push_back(head->val);
            head=head->next;
        }
        return res = createBalanceBST(nums,0,nums.size()-1);
    }
    TreeNode* createBalanceBST(vector<int>& nums,int left,int right){
        if(left>right) return NULL;
        int mid=(left+right)/2;
        TreeNode* tr = new TreeNode(nums[mid]);
        tr->left=createBalanceBST(nums,left,mid-1);
        tr->right=createBalanceBST(nums,mid+1,right);
        return tr;
    }
};