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

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 😊

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

very nice explanation please keep making such videos

great explanation, thanks for doing this!

fab explanation

Great explanation!

Very well explained!

Great Explaination .Pls keep making more vidoes

Great aproach Nikhil, you are a saviour

what a solution !!

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?

Thanks, so simple

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!

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

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!