Binary tree-Level Order Traversal.cpp

// https://www.youtube.com/watch?v=86g8jAQug04
#include <iostream>
#include <queue>
using namespace std;
struct Node
{
    char data;
    Node *left;
    Node *right;
} void LevelOrder(Node *root)
{
    if (root == NULL)
        return;
    queue<Node *> Q;
    Q.push(root);
    while (!Q.empty())
    {
        Node *current = Q.front();
        cout << current->data << " ";
        if (current->left != NULL)
        {
            Q.push(current->left);
        }
        if (current->right != NULL)
        {
            Q.push(current->right);
        }
        // removing the element at front
        Q.pop();
    }
}