A Binary Tree Breadth First Traversal also known as Level Order Binary Tree Traversal is a method of visiting all the nodes of a binary tree level by level, from left to right.

Pseudo Code Flow Representation

START

Function printLevelOrder():
    If root is NULL:
        Return
    Create Queue
    Add root to Queue
    While Queue is not empty:
        Remove node from Queue
        Print node.data
        If left child exists:
            Add to Queue
        If right child exists:
            Add to Queue

END