Validate Binary Search Tree (LeetCode 98) | Full solution with animations and visuals
Actual Problem: leetcode.com/problems/validat...
Chapters:
00:00 - Intro
01:02 - Problem Statement and Description
03:29 - A level order traversal won't work
06:06 - Different tree traversals
10:07 - Using in-order traversal
12:29 - Dry-run of Code
15:27 - Final Thoughts
📚 Links to topics I talk about in the video:
Level Order Traversal: • Level order traversal ...
Pre-order Traversal: • Pre-order traversal of...
Post-order Traversal: • Post-order traversal o...
In-order Traversal: • Pre-order traversal of...
Binary Tree: • Binary Trees Introduct...
Binary Search Tree: • What is a Binary Searc...
📘 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
Пікірлер: 26
It doesn't matter how long the video is... Clarity is the key to understand and you have it in your videos. Keep it up!
@nikoo28
Ай бұрын
i know...sometimes the video gets a little long
Every time I search for a problem explanation on youtube, I have this immediate sigh of relief, if your video shows up 😁
update: I really appreciate these tutorials and plan to support your work soon. I had requested coverage on algorithms' time and space complexity, but Nikhil made me realize they are already included in the videos. Thanks for providing such valuable content. Big thanks and God bless you!
@nikoo28
Ай бұрын
I talk about the time and space complexity in every problem. It is always near the dry-run of the code
@EddyTriedCoding
Ай бұрын
@@nikoo28 My bad! I'll make sure to reach the end of the videos. I usually pause towards the end to convert the code into Python, which is probably why I haven't finished most of them. Thanks!
Great aproach Nikhil, you are a saviour
great explanation, thanks for doing this!
this is what i was looking for. The video has explanation of 12 min and 4 min on coding part. Very few youtubers does this. I like your approach. Thank you
@nikoo28
Жыл бұрын
Glad you liked it!
Thanks, my brother. You're explanations really help me understand.❤
@nikoo28
Ай бұрын
You are very welcome
very nice explanation please keep making such videos
Great Explaination .Pls keep making more vidoes
Thanks, so simple
Great explanation!
what a solution !!
Very well explained!
@nikoo28
4 ай бұрын
Glad it was helpful!
fab explanation
Hi sir, actually I seen Ur backtracking video, very simple explanation I understand easily i commented in that video to make problem solving videos, I didn't get how to solve. thankyou 😊
@nikoo28
Жыл бұрын
All the best
Hi Nikhil how you are using this red hi-lighter while explaining could you pls tell.. it's look nice.. which tool you are using for Presentation
@nikoo28
10 ай бұрын
that will be GoodNotes 6 on iOS
Actually, in the first example, you selected node 5 to check if it satisfies the bst rule and said it does but i think it doesn't. The roght child should be larger than the node, shouldn't it?
you are mistaken at 2:04 to say that Subtree 5, 1, 4 satisfies the criteria of a binary search tree. Clearly the right child (4) is less than the parent (5)