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.

Subscribe to see which companies asked this question

/**
 * 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) {
        int len = 0;
        for (ListNode *temp = head; temp != NULL; temp = temp->next) {
            ++len;
        }
        return sortedListToBST(head, len);
    }
private:
    TreeNode* sortedListToBST(ListNode *head, int len) {
        if (len <= 0) {
            return NULL;
        }
        ListNode *mid = head;
        int k;
        for (k = 0; k < len / 2; ++k) {
            mid = mid->next;
        }
        TreeNode *root = new TreeNode(mid->val);
        root->left = sortedListToBST(head, k);
        root->right = sortedListToBST(mid->next, len - k - 1);
        return root;
    }
};