Function to print the level order traversal of the Binary tree
static void print ( Node root ) { List < Node > Q = new List < Node > ( ) ; Q . Add ( root ) ; while ( Q . Count > 0 ) { Node temp = Q [ 0 ] ; Q . RemoveAt ( 0 ) ; Console . Write ( temp . data ) ; if ( temp . left != null ) Q . Add ( temp . left ) ; if ( temp . right != null ) Q . Add ( temp . right ) ; } }