根據一個數組來建一棵二叉樹

#include<iostream>
#include<vector>

using namespace std;

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

TreeNode* newNode(int val) {
    if (val == -1) {
        return nullptr;
    }

    TreeNode
 
* node = new TreeNode;
    node->left = nullptr;
    node->right = nullptr;
    node->val = val;
    return node;    
}

TreeNode* preOrder(TreeNode* node, const vector<int> &arr ,const int index) {
    if (index > arr.size() || arr[index] == -1) {
        return nullptr;
    }
    
 
if (node == nullptr ) {
        node = newNode(arr[index]); 
    }
    node->left = preOrder(node->left, arr, index*2+1);
    node->right = preOrder(node->right, arr, index*2+2);
    return node;
}

TreeNode* createTree(const vector<int>& treeArr) {
    TreeNode* root = nullptr;
    preOrder(root, treeArr, 
 
0);
}

int main() {
    vector<int> arr = {3, 9, 20, -1, -1, 15, 7};
    TreeNode* root = createTree(arr);
    return 0;
}