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

#include <iostream>
#include <vector>

using namespace std;

struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

TreeNode* creatBST(vector<int>& nums, int start, int end){
    if(start > end)
        return NULL;
    int mid = (start + end) / 2;
    TreeNode* root = new TreeNode(nums[mid]);
    root->left = creatBST(nums, start, mid - 1);
    root->right = creatBST(nums, mid + 1, end);
    return root;
}

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