LeetCode-NOTES/Algorithms/108.Convert-Sorted-Array-to-Binary-Search-Tree/solution.cpp at master · mkn-root12/LeetCode-NOTES · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution
{
public:
    TreeNode* createTree(vector<int> &num,int left, int right)
    {
        if(left > right)
            return NULL;
        int mid = (left+right)/2;

        TreeNode *leftNode = createTree(num, left, mid - 1);
        TreeNode *rightNode = createTree(num, mid + 1, right);

        TreeNode *node = new TreeNode(num[mid]);

        node->left = leftNode;
        node->right = rightNode;

        return node;
    }

    TreeNode *sortedArrayToBST(vector<int> &num)
    {
        return createTree(num,0,num.size()-1);
    }
};