50029. Tree Construction

#include <stdlib.h>
#include "tree.h"

Node* solve(int arr[], int n, int now){
    if(now >= n) return NULL;

    Node* root = malloc(sizeof(Node));
    root->label = arr[now];
    root->left = solve(arr, n, now * 2 + 1);
    root->right = solve(arr, n, now * 2 + 2);
    return root;
}

Node* construct(int array[], int n){
    return solve(array, n, 0);
}