Question

Let’s say theres a binary tree like that.

I’d like to read it floor by floor (from left to the right) so the output would look like:

2 4 5 3 1 3 9

Thanks.

Answer 1

Its Printing in BFS, You should use auxiliary data-structure Queue: Learn here

listed below is pseudocode for a simple queue based level order traversal,

levelorder(root) 
  q = empty queue
  q.enqueue(root)
  while not q.empty do
    node := q.dequeue()
    visit(node)
    if node.left ≠ null
      q.enqueue(node.left)
    if node.right ≠ null
      q.enqueue(node.right)