In case there are elements in the Binary tree , perform a level order traversal using a Queue
List < Node > Q = new List < Node > ( ) ; Q . Add ( root ) ; while ( Q . Count != 0 ) { Node temp = Q [ 0 ] ; Q . RemoveAt ( 0 ) ;