Push the current level node
if ( ! M . containsKey ( l ) ) { Vector < Integer > temp = new Vector < Integer > ( ) ; temp . add ( root . data ) ; M . put ( l , temp ) ; } else M . get ( l ) . add ( root . data ) ;