If leaf node reached , increment count of path length of this root to leaf path .
if ( node . left == null && node . right == null ) { if ( ! m . containsKey ( path_len ) ) m . put ( path_len , 0 ) ; m . put ( path_len , m . get ( path_len ) + 1 ) ; return ; }