Symmetric Tree - Leetcode 101 - Trees (Python)

Master Data Structures & Algorithms for FREE at AlgoMap.io/
Code solutions in Python, Java, C++ and JS for this can be found at my GitHub repo here: github.com/gah...
Complete DSA Pathway Zero to Hero: • Data Structures & Algo...
Please check my playlists for free DSA problem solutions:
• Fundamental DSA Theory
• Array & String Questions
• 2 Pointers Questions
• Sliding Window Questions
• Binary Search Questions
• Stack Questions
• Linked List Questions
• Tree Questions
• Heap Questions
• Recursive Backtracking...
• Graph Questions
• Dynamic Programming (D...
My Data Science & ML RUclips Playlist: • Greg's Path to Become ...
Learn Python and Data Science FASTER at mlnow.ai :)
University of California DSA Certificate on Coursera: bit.ly/3CYR6wR
Best Courses for Machine Learning:
---------------------------------------------------------------------------------------------------------
Math Prerequisites: bit.ly/3ASUtTi
Machine Learning: bit.ly/3d1QATT
Deep Learning: bit.ly/3KPfint
ML Ops: bit.ly/3AWRrxE
Best Courses for Statistics:
---------------------------------------------------------------------------------------------------------
Introduction to Statistics: bit.ly/3QkEgvM
Statistics with Python: bit.ly/3BfwejF
Statistics with R: bit.ly/3QkicBJ
Best Courses for Big Data:
---------------------------------------------------------------------------------------------------------
Google Cloud Data Engineering: bit.ly/3RjHJw6
AWS Data Science: bit.ly/3TKnoBS
Big Data Specialization: bit.ly/3ANqSut
More Courses:
---------------------------------------------------------------------------------------------------------
Tableau: bit.ly/3q966AN
Excel: bit.ly/3RBxind
Computer Vision: bit.ly/3esxVS5
Natural Language Processing: bit.ly/3edXAgW
IBM Dev Ops: bit.ly/3RlVKt2
IBM Full Stack Cloud: bit.ly/3x0pOm6
Object Oriented Programming (Java): bit.ly/3Bfjn0K
TensorFlow Advanced Techniques: bit.ly/3BePQV2
TensorFlow Data and Deployment: bit.ly/3BbC5Xb
Generative Adversarial Networks / GANs (PyTorch): bit.ly/3RHQiRj
Become a Member of the Channel! bit.ly/3oOMrVH
Follow me on LinkedIn! / greghogg
Full Disclosure:
Please note that I may earn a commission for purchases made at the above sites! I strongly believe in the material provided; I only recommend what I truly think is great. If you do choose to make purchases through these links; thank you for supporting the channel, it helps me make more free content like this!

[@GregHogg]

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

[@servantofthelord8147]

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

[@GregHogg]

Thank you!

[@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 :)

[@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

[@anmolacharya309]

Great Animation

[@ghost_7701]

Dude Python is a pseudo code!😮

[@GregHogg]

Haha pretty much yeah