Symmetric Tree - Leetcode 101 - Trees (Python)

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@servantofthelord8147]

Wow. Such a beautiful solution. Excellent work as always Greg!

[@GregHogg]

Thank you!

[@SivaTechVerse]

Greg is great as usual!

[@DTsertsvadze]

Hey Greg you rock dude! Big fan of your approach.. btw what app are you using for drawing?

[@GregHogg]

Sorry for the slow reply! I use miro :)

[@SivaTechVerse]

love your videos

[@anmolacharya309]

Great Animation

[@raymondchan3925]

Question: Thanks for the instruction!! love it but one question though. If you call same(root, root) at he beginning, wouldn't you ends up with two identical call stacks and ends up with Time: O(2n) ? Why not do same(root.left, root.right) from the start? I understand you will have to do something to check the initial root and the first two children but the trade off is you have 50% improvement in time, right?

[@viswanathvuppala4526]

How about doing a level order traversal and check if every level is a Palindrome.

[@GregHogg]

That's a cool solution

[@viswanathvuppala4526]

@@GregHogg Hey, thanks!

[@etaidiary]

@@viswanathvuppala4526 tried that, they have a case that blocks that

[@KRISHNASINGH-i2v]

Hey greg big fan From india Can you please put more binary tree questions already completed what you have posted on binary tree

[@ghost_7701]

Dude Python is a pseudo code!😮

[@GregHogg]

Haha pretty much yeah