In case the right child does not exist , insert the new Node as the right child
if ( temp . right == null ) { temp . right = new Node ( data ) ; break ; } else Q . push ( temp . right ) ; } } return root ; }