C++ 先序遍历还原二叉树

输入数组，数组中为树先序遍历结果，空节点值为-1

Node* createTree(vector<int> nums, int &pos) {
    int n = nums.size();
    if (pos >= n || nums[pos] == -1) return NULL;
    Node *root = (Node *)malloc(sizeof(Node));
    root->val = nums[pos];
    if (pos < n) {
        root->left = createTree(nums, ++pos);
        root->right = createTree(nums, ++pos);
    }
    return root;
}