Check if a tree is bst or not

This video explains how to check if a given binary tree is a binary search tree or not in simplest way possible. I have explained the concept of a BST first (including the cases when you can call a binary tree as BST). After concepts, i have explained the algorithm for determining a binary tree to be a BST. CODE LINK is given below. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
CODE LINK: drive.google.c...

[@shobitjain9619]

Highest underrated channel in tech field. Hats off to your explanation.

[@techdose4u]

Thanks :)

[@ajikka5609]

Now folks can tip, so vote with $$

[@HimanshuKumar-xz5tk]

I really don't know what these 8 dislikers want
This is such an awesome explanation!
I appreciate all the work you do, thank you so much brother

[@techdose4u]

Welcome :)

[@abhishekshrivastav6193]

@@trigger3012 bro optimization to ho phle normal navie approach to sikh lo

[@ashutoshtiwari4719]

@@trigger3012 It's O(n) , every node is visited only once.

[@259_parthpatidar9]

@@ashutoshtiwari4719 hold my backtracking

[@sidharthansidhu4783]

This is the clearest explanation of this topic that I have found on the internet.

[@depression_plusplus6120]

This channel is like a motivation to all NON TECH college students that with determination you can go for tech jobs

[@techdose4u]

👍🏼

[@sb-jo2ch]

This explanation finally clicked for me. Thanks!

[@techdose4u]

Great ❤️

[@mayurkapadnis4265]

Excellent explanation with examples 🙏🙏, thank you sir

[@abhaytiwari6411]

# 1 Like
plz upload video quickly
because i feel bored
when you are not uploding video

[@techdose4u]

Bro i am home right now. Will upload quickly once I reach my workplace :) These are advance videos which i already made.

[@abhaytiwari6411]

@@techdose4u OK

[@TomerBenDavid]

Excellent explanation would be great also to see some Java code

[@techdose4u]

Bro i dont know java. I need to copy it from somewhere but i cant explain if something goes wrong. That's why i don't upload java codes :(

[@shinewanna3959]

System.out.print(checkBST(root, 0, 100));// print
bool checkBST(Node root, int min, int max) {
if (root == null) return true; // BST
if (root.value >= min && root.value

[@shinewanna3959]

I more thing to coder, it'll work only with checkBST, isBST method from your source code should be removed.

[@uditpurohit7643]

this code is not working in gfg practice question

[@SergekSh]

Excellent explanation!!! thank you!

[@junelcjun]

very good explanation. do you have iterative solution as well?
thanks a lot.

[@techdose4u]

Don't remember

[@ichigo138]

For a valid binary tree inorder traversal has to be increasing in nature right .. Can we do that ?

[@techdose4u]

No. For an invalid case the inorder might still be increasing.

[@ryan-bo2xi]

Excellent !

[@techdose4u]

Thanks :)

[@SumitSingh-wn5se]

[2147483647,2147483647] what about this test case?
it would def fail.

[@techdose4u]

You need to make modifications depending on constraint dude. If your value contains INT_MAX then either modify your if condition or take a larger MAX/MIN by using long. Simple.

[@anupriyanishad]

Simply use :
Long min= -pow(2,31)-1
Long max= pow(2,31)+1

[@hareeshkumar922]

@@anupriyanishad why can't be done here
long min =INT_MIN-1;
long max= INT_MAX+1;
it is actually showing error
runtime error: signed integer overflow: -2147483648 - 1 cannot be represented in type 'int'

[@shivamchauhan2673]

Thankyou sir, You are the best

[@techdose4u]

Welcome :)

[@praveensoni1119]

best explaination

[@techdose4u]

Thanks

[@ALEEMKHAWAR1]

very well explained

[@willturner3440]

Great, but what about time and space complexity

[@yashukumar8489]

Could you please help me to resolve the issues when root->right=NULL or root->left=root->data.

[@rohandevaki4349]

do explain the coding also , explaination itself sometimes is not enough , we get stuck in coding sometimes. ,if possible add code in java also, not only c++

[@baidya87]

thank you !

[@techdose4u]

Welcome :)

[@shashankpagrut8415]

Thank You

[@techdose4u]

Welcome

[@mahesh4274]

Please explain the code also...

[@techdose4u]

If you face doubt in any part of the code then do let me know.

[@maheshm4292]

@@techdose4u if you don't mind, can you share the code through gist, or github , in the future videos maybe. Good night. Happy new year. 🎉

[@maheshm4292]

@@techdose4u if doubt, how should I let you know , through comments or any other way????

[@techdose4u]

Same to you :)

[@techdose4u]

Through comments. If i couldn't reply and it's urgent then you can use mail.

[@urrahman196]

3:13