vector<int> g[100];

void solve(Tree *root, int dep) {
    g[dep].push_back(root->data);
    if(root->left != null) {
        solve(root->left, dep + 1);
    }
    if(root->right != null) {
        solve(root->right, dep + 1);
    }
}