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 . Add ( path_len , 1 ) ; else m [ path_len ] = m [ path_len ] + 1 ; return ; }