Check for BST | Validate Binary Search Tree | Validate BST | Check BST | DSA-One Course #69
HTML-код
- Опубликовано: 6 сен 2024
- Hey guys, In this video, We're going to solve an important Binary Search Tree problem known as Check if a Tree is a Binary Search Tree or not.
Practice here: practice.geeks...
💸 Use coupon code ANUJBHAIYA on GeeksforGeeks to avail discounts on courses!
🥳 Join our Telegram Community:
Telegram channel: telegram.me/re...
Telegram group: telegram.me/ds...
🚀 Follow me on:
Instagram: / anuj.kumar.sharma
Linkedin: / sharma-kumar-anuj
Twitter: / realanujbhaiya
📚 Complete DSA Playlist: • DSA-One Course - The C...
Complete Android Development Playlist: • Android Development Tu...
Hashtags:
#anujbhaiya #dsaone
Tags:
check for bst
validate binary search tree
anuj bhaiya
validate bst
bst
check bst
binary search tree
valid bst
98. validate binary search tree
anuj bhaiya java
check for balanced tree
is bst
check if bst
anuj bhai
apna college
binary search
bst in java
dsa java
dsp anuj bhaiya
valid binary search tree
binary search in c
binary tree to bst
java anuj bhaiya
java by anuj bhaiya
Hi bro... Your teachings are genuinely good. But why don't you start teaching in English so that it will be easier for many students to understand.
i think hindi is our national language so its better this way otherwise u can see captions too
@@ayushop1921 yes, you are totally correct.
@@ayushop1921 lol 😂 you are an indian still you don't know that India doesn't have a national language. 🤦
@@ayushop1921 hindi isn't our national language, India doesn't have a national language, precisely.
@@10daysAgo kuchh din baad ho jayegi
More than 10k views with only 300 likes . Please like the video guys. Thanks Bro for the wonderful content 😊
The solutions are good , but there is one problem , if there are two nodes with same value then this can't handle that case , we have to use a hashmap , to get get the frequency of each element in it.
Came hare after watching the same video from Apna College.. Anuj bhiya se ek baar me samajh aa gaya + ek alternate solution bhi mila with same time and space... Thank You Bhaiya
Bro mai btech cse(data science) ka student hun, college 3rd tier hai.. Mai confused hun ki mai web development karu ya data science.. Product based Companies ko kis cheez ki requirement hoti hai..salary kiski acchi hoti hai..agar data science choose kare tho faang companies me select ho payenge kya..agar data science choose karoo tho sath me orr kya sikhna chaiye ki mai acche product based companies me select ho sakhu.. Pls make a video on this.
another way is to find the inorder traversal and check if the array that comes out is sorted or not.
Thanks a lot bhaiya! 😄
Sir please add English captions for all DSA , Humble request.
It's a work in progress. We've adding subtitles in all DSA One videos now.
@@AnujBhaiya For captions if its taking time you can try using Premiere pro auto transcribe feature: Hope it helps expedite the process
@@AnujBhaiya ek saal ho gaya
Top class video
in inorder approach it should be if(prev!=NULL && node.data
For the range solution we need to caste all values to double because it will fail when values are infinite or -infinite
it depends upon the driver code, which datatype they have taken...
Sir eagerly waiting for videos ok backtracking and greedy
Really grateful for your work
You're videos have been very helpful for me
Thanks for everything
Thanks ❤
Thank you Anuj sir...
Awesome explanation ..Please make videos on springBoot as well
😅 bhaiya second wale code ka flow samaj nhi aaya , 2nd wala soln koi kese soch sakta he yrr
Thanks bhayia
Maza agaya bhaiya waah 🎉
radhe ! nice....
Awesome bhaiya.. maza aa gya
amazing explanation, thank you bhaiya !
thankyou bhaiya
Understood💯
Great explanation
Thankyou Bhaiya for Continuing the Playlist.
Sir when this course will be fully completed
Thank you for the video and great explanation.
Great explanation Anuj ❤❤
amazing explanation ever
Hum is inorder traverse karke array main sorted element store karenge !to Ho jaiga traverse bhi or checking bhi
Jab hum add kareng use pahle check kareng ki o element allready to nahi or array ka last element small hona chahiye iss tarah !!❤
ANUJ BHAIYYA PLEASE DONT BE DEMOTIVATED FOR LESS VIEWS PLEASE,
So, why don't you share it with your friends?
@@shivankverma6482 😂😂
awesome content. Thank you.
class Solution
{
Node p = null;
boolean ans = true;
boolean isBST(Node root)
{
if(root != null) {
isBST(root.left);
if(p != null && root.data
thank you bhaiya
hats off Anuj bhaiya
Bhaiya plzz how to clear service based pe bhi ek video bnao...kitni coding required hoti hai unke liye..
PLZZZZZZZZXXXXZZZZZZZZZZZZ
Bro i want to learn DSA but I've knowledge on only core Java is advanced Java required to learn DSA through java pls give reply bro
There is no such rule. But you should have knowledge of any one programming language as an algorithm is totally language-independent.
DP VIDEO upload
First comment ❤️❤️🎉
Can you make playlists of these videos by topic. I find it hard to track the video sequence.
All topics videos are in a continuous manner. So I don't think there should be any problem accessing it.
bhai code ko run kraya kro baad me kuch na kuch issue hota hai ....
WHY YOU HAVE DECLARED NODE NULL OUTSIDE OF FUNCTION
I am so dummmmmb.
Hi Anuj Bhaiya! Mera comment pin krdo Mai dosto ko dikhao ga
Dost ye bhi dekh lenge ki tumne kaise pin karwaya hai.
@@shivankverma6482 🤣🤣
Great Explanation