IUxlzv - Online C++ Compiler & Debugging Tool

#include <iostream>
#include <queue>
using namespace std;

struct Node{
    int data;
    Node *left, *right;
    Node(int x) {
        data=x;
        left=right=NULL;
    }
};

void insert(Node* &root, int x) {
    if (root==NULL){
        root = new Node(x);
        return;
    }
    if (root->data>x) insert(root->left, x);
    if (root->data<x) insert(root->right, x);
}

void rightLevelOrder(Node* root) {
    if (root==NULL) return;

    queue<Node*> q;
    q.push(root);

    while (!q.empty()) {
        int level_size = q.size();
        while (level_size--) {
            Node* curr = q.front(); q.pop();
            cout<<curr->data<<" ";
            if (curr->right) q.push(curr->right);
            if (curr->left)  q.push(curr->left);
        }
    }
    cout << endl;
}

int main() {
    int t; cin >> t;
    while (t--) {
        int n;
        cin >> n;
        int a[10005];
        for (int i=0;i<n;i++) {
            cin>>a[i];
        }
        Node* root=NULL;
        for (int i=0;i<n;i++) {
            insert(root, a[i]);
        }

        rightLevelOrder(root);
    }

    return 0;
}