Check if nodes of current levels are anagrams or not .
curr_level1 . Sort ( ) ; curr_level2 . Sort ( ) ; for ( int i = 0 ; i < curr_level1 . Count ; i ++ ) if ( curr_level1 [ i ] != curr_level2 [ i ] ) return false ; } return true ; }