Check if all levels of two trees are anagrams or not | GeeksforGeeks

preview_player
Показать описание

This video is contributed by Anant Patni.

Please Like, Comment and Share the Video among your friends.

Install our Android App:

If you wish, translate into local language and help us reach millions of other geeks:

Follow us on Facebook:

And Twitter:

Also, Subscribe if you haven't already! :)
Рекомендации по теме
Комментарии
Автор

I don't think it runs in O(n) bcs you are doing sorting n times..so it's n log(n)

sandeeprajurs
Автор

what a stupid explaination .Literally just wasted 5 mins here

aarthiminde