BFS

bfs.h

struct node {
    int data;
    node *left = nullptr;
    node *right = nullptr;
};

void TraversBFS(node *root) {
    std::queue<node *> q;
    q.push(root);
    for (node *n = q.front(); !q.empty(); n = q.front()) {
        q.pop();
//          visit( n );
        if (n->left)
            q.push(n->left);
        if (n->right)
            q.push(n->right);
    }
}