In case there are elements in the Binary tree , perform a level order traversal using a Queue
queue < Node * > Q ; Q . push ( root ) ; while ( ! Q . empty ( ) ) { Node * temp = Q . front ( ) ; Q . pop ( ) ;