Breadth First Traversal

BreadthFirstTraversal.cpp

 void traverseLevelOrder() {
        if (head == nullptr) return;
        std::cout << "-- LEVEL ORDER TRAVERSE" << std::endl;
        std::queue<BSTNode*> queue;
        queue.push(head);
        while (!queue.empty()) {
            BSTNode* current = queue.front();
            std::cout << queue.front()->value << std::endl;
            if (current->left != nullptr) queue.push(current->left);
            if (current->right != nullptr) queue.push(current->right);
            queue.pop();
        }
    };

See breadthFirstSearch AlgoExpert Implementation