<p>Given the <code>head</code> of a singly linked list where elements are sorted in <strong>ascending order</strong>, convert <em>it to a </em><span data-keyword="height-balanced"><strong><em>height-balanced</em></strong></span> <em>binary search tree</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/17/linked.jpg" style="width: 500px; height: 388px;" />
<pre>
<strong>Input:</strong> head = [-10,-3,0,5,9]
<strong>Output:</strong> [0,-3,9,-10,null,5]
<strong>Explanation:</strong> One possible answer is [0,-3,9,-10,null,5], which represents the shown height balanced BST.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> head = []
<strong>Output:</strong> []
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li>The number of nodes in <code>head</code> is in the range <code>[0, 2 * 10<sup>4</sup>]</code>.</li>
	<li><code>-10<sup>5</sup> &lt;= Node.val &lt;= 10<sup>5</sup></code></li>
</ul>

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:


    TreeNode* createBinaryTree(int value, TreeNode* root){
        if(root == nullptr) return new TreeNode(value);
        if(root && root->val > value)
            root->left = createBinaryTree(value,root->left);
        if(root && root->val < value){
            root->right = createBinaryTree(value,root->right);
        }
        return root;
    }

    TreeNode *solve(vector<int>& values, int low, int high, TreeNode* root){
        if(low <= high){
            int mid = low + (high - low)/2;
            root = createBinaryTree(values[mid], root);
            solve(values, low,mid-1,root);
            solve(values,mid+1,high,root);
        }

        return root;
    }
    TreeNode* sortedListToBST(ListNode* head) {
        vector<int> values;
    
        ListNode *track;
        track = head;
        while(track){
            values.push_back(track->val);
            track = track->next;
        }

        TreeNode *result;
        result = nullptr;
        result = solve(values,0,values.size()-1, result);

        return result;

    }
};
30100