50028. Subtrees

#include "subtree.h"

int n = 0;

int solve(Node* root, int k, int arr[]){
    if(!root) return 0;
    int l = solve(root->left, k, arr);
    int r = solve(root->right, k, arr);
    if((l) && (r) && (root->label != k)){
        arr[n++] = root->label;
    }
    return (l) || (r) || (root->label == k);
}

int getNode(Node *root, int label[], int k){
    n = 0;
    int* arr = label;
    solve(root, k, label);

    return n;
}