Pop complete current level
while ( NodeCount > 0 ) { Node Node = q . First . Value ; q . RemoveFirst ( ) ; if ( Node . left != null ) { q . AddLast ( Node . left ) ; } if ( Node . right != null ) { q . AddLast ( Node . right ) ; } NodeCount -- ; }