inserts its right and left children in the front of the deque
if ( node . right != null ) q . AddFirst ( node . right ) ; if ( node . left != null ) q . AddFirst ( node . left ) ; nodeCount -- ; } } level ++ ; }