#### Traverse the binary tree in breadth first search also known as level order traversal manner.

// Should print 8, 3, 10, 1, 6, 14, 4, 7, 13

### Pseudo Algorithm

PSEUDO ALGORITHM (Breadth first search approach)

- Create an empty queue
**q** - Enqueue
the root node**q** - Loop while queue is not EMPTY
= dequeue**temp_node****q**- print
’s data**temp_node** - Enqueue
’s children (first left then right children) to**temp_node****q**

```
---
---
```