Check Mirror in N-ary tree GfG POTD | Given two n-ary trees, Check if they are mirror images

[@probabilitycodingisfunis1]

unordered_mapm;
for(int i=0;i

[@mukulsingh6076]

you have check if map.containskey(A[i]);
but what have we put in map , is it map.put( i,empty stack) or map.put(a[i],null);???

[@sourabhthakre4125]

Simple , easy to understand and concise . Isn't that what is we usually looks for ?

[@SirAkPandey]

You're the best Ma'am!🙏

[@srinjaykapri7]

your explaination technique is amazing ..thank u mam

[@shvmsh20]

Awesome explaination... Keep going

[@ankitgarg6680]

appreciate your efforts really good explanation

[@yashsharma6112]

Explanation was so good that honestly I have to Sign In into the you tube (as I was watching it on my desktop without Sign In ) just to like this video : )
THANKS FOR THE EXPLANATION

[@probabilitycodingisfunis1]

Haha thanks for the efforts yash :)

[@__k.abhishek]

Outstanding explanation. Easy to understand. You are one of the youtubers i like the video most🚀🚀

[@divyanshudwivedi3756]

You explained it very well . Thanks !

[@venkateshkhandavilli7244]

Thanks for your video I have seen the solution from other video, I did not got understand what he said , but u have explained it very easily thank you once again

[@pravendrasingh6172]

Really I nice explanation. Keep doing these videos.I watch your videos whenever I stuck in daily challenge of Geeksforgeeks. You explain really well 👏

[@probabilitycodingisfunis1]

Thank you so much Pravendra

[@cr7johnChan]

Thank You Ma'am ,your explanation was clear enough for me to understand and implement it myself . Anyways ,thanks for the coding it down for the rest of us .

[@probabilitycodingisfunis1]

Thank you Randeep !

[@cr7johnChan]

@@probabilitycodingisfunis1 🙏

[@bishalkundu7592]

Just awesome ❤️

[@ajinkyaudatewar221]

Amazing explanation 💯

[@gyandyan]

Veryy very nice explanation 🥰🥰🥰🥰

[@aryansiroyajain8503]

wish u were in my college☺. Great Work🔥

[@hritikrawat6452]

Crystal clear

[@sharadyadav9630]

Good explain

[@Amitkumar-nw5mt]

Loved it Di .

[@rohitumadi9544]

great solution 👍

[@AmanSharma-vb5jl]

you are genius!

[@PranavPrajapati-hd2eu]

Nice explanation ...mam

[@prabhatmishra5667]

In the question they didn't mention that there is no limit to children in this question. You saved a lot of time. I was confused that there maybe NULLs lying in between edges

[@vimalslab3398]

Ma'am aap Baal khol k he padhayi ye accha lagta h 🥰.

[@code_lover2889]

Waiting for your video ma'am 😍

[@govindprajapati3354]

I love you and your voice

[@girikgarg8]

Nice explanation

[@Rajat_maurya]

Thank you

[@akashkandpal1832]

Thanks for this.
U look beautiful ❤️

[@prabhatmishra5667]

Great explanation. Thanks alisha, from which college are you ?

[@manishmate9991]

Fantastic !!!!!!!!!!!!

[@dhananjoydey1337]

awesoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooome

[@sanketsuryawanshi]

Thanks a lot 😊

[@MK-ic6vo]

what a explanation damn!!

[@ARUN-ik2nb]

From how long have you been coding?

[@ayushiarya870]

Can u plz make me understand line no. 29? I hven't understood that

[@AmanMishra-rg3jd]

nice explanation

[@salonibhardwaj3200]

Nice explanation

[@643kanavguleria9]

nice explanation

[@643kanavguleria9]

class Solution {
static int checkMirrorTree(int n, int e, int[] A, int[] B) {
HashMap mp = new HashMap();
for(int i=0;i