i > 0 because when i is 0 prev points the last node of previous level , so we skip it
if ( i > 0 ) prev . nextRight = temp ; if ( temp . left != null ) q . add ( temp . left ) ; if ( temp . right != null ) q . add ( temp . right ) ; }