Validate Binary Search Tree (LeetCode 98) | Full solution with animations and visuals

preview_player
Показать описание

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:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#leetcode #programming #interview
Рекомендации по теме
Комментарии
Автор

Every time I search for a problem explanation on youtube, I have this immediate sigh of relief, if your video shows up 😁

ghanashrim
Автор

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!

leonelmessi
Автор

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

everyontech
Автор

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!

EddyTriedCoding
Автор

Great aproach Nikhil, you are a saviour

knowingly-unknown
Автор

I code in cpp, and your solutions are in java, it turns out to be pretty productive for me because i cannot copy it directly and had to use my own brains for the sake of doing the problem hehe...love your videos <3

sahilanand
Автор

Thanks, my brother. You're explanations really help me understand.❤

athulsebastian
Автор

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 😊

navyashreeamam
Автор

great explanation, thanks for doing this!

Babas
Автор

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)

maheshj
Автор

very nice explanation please keep making such videos

prakashnavin
Автор

Great Explaination .Pls keep making more vidoes

parthmodi
Автор

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?

sanjeetnishad
Автор

It will be better if you will explain iterative and recursive both of solution of every problem

kappyM
Автор

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

groww-india
Автор

Others YouTube videos🤡🤡
Nikhil sir 👿👿

kanaramjangid