Why time complexity for level order printing O(n*n)?

#1

For level order printing we have to travel all levels and for each level (or node) recursive function is called twice. Hence it should be O(2^N).

#2

Level order printing of tree

  1. using recursion takes time O(2^n)
  2. using queue takes time O(n)
    where n is no of nodes in tree
#3

But in video sir said it’s O(n^2)