Same Tree (LeetCode 100) | Full solution with visuals and animations | Study Algorithms

Two trees even if they are different can result in a same traversal result. This happens because of the non-linear structure of the tree data structure. A neat little trick can be applied to the level order traversal technique to determine if two trees are exactly the same. Watch this video to understand how you can take advantage of the actual structure of a tree node and arrive at a solution.
Actual Problem: leetcode.com/problems/same-tree/
Chapters:
00:00 - Intro
00:52 - Problem Statement and Description
02:58 - What exactly are same trees?
05:50 - A trick with level order traversal
09:02 - Dry-run of Code
12:57 - Final Thoughts
📚 Links to topics I talk about in the video:
LeetCode Problems: • Leetcode Solutions
Other easy problems: • Easy Problems
Level Order Traversal: • Level order traversal ...
Binary Tree: • Binary Trees Introduct...
📘 A text based explanation is available at: studyalgorithms.com
Code on Github: github.com/nikoo28/java-solut...
Test-cases on Github: github.com/nikoo28/java-solut...
📖 Reference Books:
Starting Learn to Code: amzn.to/36pU0JO
Favorite book to understand algorithms: amzn.to/39w3YLS
Favorite book for data structures: amzn.to/3oAVBTk
Get started for interview preparation: amzn.to/39ysbkJ
🔗 To see more videos like this, you can show your support on: www.buymeacoffee.com/studyalg...
🎥 My Recording Gear:
Recording Light: amzn.to/3pAqh8O
Microphone: amzn.to/2MCX7qU
Recording Camera: amzn.to/3alg9Ky
Tablet to sketch and draw: amzn.to/3pM6Bi4
Surface Pen: amzn.to/3pv6tTs
Laptop to edit videos: amzn.to/2LYpMqn
💻 Get Social 💻
Follow on Facebook at: / studyalgos
Follow on Twitter at: / studyalgorithms
Follow on Tumblr at: / studyalgos
Subscribe to RSS feeds: studyalgorithms.com/feed/
Join fan mail: eepurl.com/g9Dadv
#leetcode #programming #interview

[@shrirangjoshi6568]

No one has solved this in this way.Thank you!!

[@floatingfortress721]

Thanks, you were able to simplify the problem and its solution for me :)

[@kunalkheeva]

Thank you for the edge cases.

[@alisheheryar1770]

Godspeed Nikhil.

[@luminraja09]

I am a fan of BFS. Thanks Man for the solution. :)

[@dineshdsv7815]

Thanks for the explanation!!

[@nikoo28]

Happy to help!

[@subee128]

Thanks

[@brentdaniels5462]

Can you do a tutorial on the recusive solution? figiured out the itreative solution but I am still a little bit confused on how the recusive solution works.

[@nikoo28]

if you understand the iterative solution, that is all you need. A recursive solution if often confusing. If you still want a recursive solution, you might find one in the leetcode discuss section. I would not recommend it though

[@smitjoshi7202]

Which one is better? recursive or iterative? Recursive solutions comes naturally to for trees usually.

[@nikoo28]

i usually prefer an iterative approach, as it is more easy to debug. Think about a scenario when you are trying to understand the flow and find what is going wrong. With a recursive approach, you will get stuck in cycles, and it gets very hard. At the end it comes down to preference.

[@mdshafiuddin1234]

sir please make playlist on recursion this concept is root for all advance concept of dsa

[@nikoo28]

yes, I will add a playlist on recursion.

[@leetcode650]

Please do solution in python or make a poll :(

[@nikoo28]

try to understand the logic rather than concentrating on the language :)

[@Amed-pf7dp]

there is no need for the extra space

[@nikoo28]

What solution would you suggest?

[@Amed-pf7dp]

@@nikoo28 class Solution { public boolean isSameTree(TreeNode p, TreeNode q) { if (p == null && q == null) { return true; } if (p != null && q != null && p.val == q.val) { return isSameTree(p.left, q.left) && isSameTree(p.right, q.right); } return false; } }

[@philandros3195]

I don't think I understand how the tree works. In the first test case the trees are q = [1, 2, 3] and p = [1, 2, 3] and if I write: return q.val == p.val and q.left == p.left and q.right == p.right, the output is False??? Also if I try just return q (for science), I would expect the output to be the tree [1,2,3], but instead the output is True?? What the fuck. How do these damn trees work?!?

[@nikoo28]

check out my complete playlist on trees, you will have a very good understanding.