L40. Search in a Binary Search Tree | BST | C++ | Java

[@takeUforward]

Please likeeee, shareeee and subscribeeeeeeee :) Also follow me at Insta: Striver_79

[@pritishpattnaik4674]

My approach : TreeNode* searchBST(TreeNode* root, int val) { if (root == NULL) return NULL; if (root->val == val) return root; if (val < root->val) return searchBST(root->left, val); else return searchBST(root->right, val); }

[@rollercoaster9719]

Same

[@abhaykumarsingh3884]

Are auxialiary space use ho rhi isme

[@CaseyXd-e3l]

It will be log2n -1 auxiliary space right ? Please clarify

[@sarangkumarsingh7901]

Awesome.........Trees mein pehli baar khud se kuch kiya.......

[@aiartisry]

Almost about to finish free ka tree series... :) Thank you so much for such amazing content. Your hard work is appreciable. After watching a video I always try to explain in same way how you used to explain intuition and dry run each step. It helps me a lot and also increases my code quality by Looking at your code. 🙌

[@satyapraneethkatta1652]

This is best series on Trees I have ever come across on youtube. Striver salute to your passion and commitment to teaching people

[@Anand-zg6jv]

bhai 1 no.content hai aur samjhaya bhut acche se hai ....bss abhi paid mt krna😂😂😂😂 plzzzzz abhi tree aadha hi pda hai aur graph poora baaki hai

[@abhishekkumar-fe8lw]

bhai konsi company ho tum abhi?

[@shivangisrivastava1158]

Thank you so much for BST !! Improving with every video.

[@MandeepKumar-ue3zy]

BST can also have depth N(if tree is skwed) it's no always Logn height.

[@takeUforward]

Yes it can be, but generally in all test cases it will be log 2 n, i have repeatedly used almost in all cases.

[@tusharnain6652]

That's where AVL trees come.

[@niharika_042]

thank you so much Vi 🙂I was almost to complete my tree series,the way of explanation i loved it a lot.

[@iamnottech8918]

yes recursive solution is also easy and possible in case u are thinking

[@shaikfahim1232]

class Solution { public: TreeNode* searchBST(TreeNode* root, int val) { if(!root) return NULL; if(root->val==val) return root; if(root->left && valval) return searchBST(root->left,val); if(root->right && val>root->val) return searchBST(root->right,val); return NULL; } };

[@spandanrastogi7144]

2 Line Java Recursive Solution Based on Same Approach : public TreeNode searchBST(TreeNode root, int val) { if(root == null || root.val == val) return root; return val < root.val ? searchBST(root.left , val) : searchBST(root.right, val); }

[@Nikhil-Tomar]

I think one correction should be there. The traversal time will not be log(N) for almost all cases

[@iamnottech8918]

He mentioned that

[@yusrax3]

in that case we have Avl tree to handle such scenario

[@ganeshjaggineni4097]

NICE SUPER EXCELLENT MOTIVATED

[@VivekSharma-eh2tv]

sir 10 can also lie on the lesser part -> the point is to make the right node greater than the root's value so we can make the right node of any node 10 , that is how the lesser part will have the greater node . Please somehow reply if i go somewhere wrong

[@enigmanarratives1]

what about if we are given a linked list wont it be O(N) time comp ? like flatten binary tree Q we had all roots in right

[@sudiptamukherjee8216]

WE CAN USE RECURSION ALOS.

[@apmotivationakashparmar722]

Thank you So much !

[@madetolaugh3476]

Could someone please explain to me the difference between...... return searchBST(root.left,val); and searchBST(root.left,val) ? Thanks in advance

[@tejas7379]

In first case "return searchBST()" you will be returning whatever value your recursive call returns. Lets say I store a returned value in a variable, "val = searchBST()", and then return the val like "return val", what you are doing is returning what you got from function call. That in short is "return searchBST()". (Try to construct recursive tree on paper) For first case: 1 return [ function(root->right) ] right) ]

[@piyushacharya7696]

in short if you have a return type except void then add return fxn() or else fxn()

[@himanshidafouty347]

Understood

[@paraskamboj1039]

thankyou sir ji

[@shaiksoofi3741]

understod

[@vaibhavpoliwal2820]

Bro you are doing superb work, very very thanks

[@dingo_5998]

Thank you bhaiya for this😊😊😊

[@spartant_1212]

Please include leetcode problem number in the description.

[@Shivi32590]

thank you

[@khitijkarmakar]

Need help , after doimg this playlist is there any other type of trees i should also learn? (AVL RED BLACK Etc)

[@UECAshutoshKumar]

Thank you sir

[@DevanshuAugusty]

space complexity for this is O(1) ?

[@herculean6748]

Could anyone please tell me where the articles from the sheet are??

[@chiragbansod8252]

understood

[@harshitjaiswal9439]

understood.

[@shouvikdatta6831]

Bro, is it preferred to use conditional operator in interviews instead of if else? Bcz the code looks complex using conditional operator.

[@ganeshkamath89]

Both are fine, as long as it is easy to read.

[@ramavathnandhini2347]

thankyou striver ..🙌

[@abhaythakur2597]

well explained

[@Shivamkumar-xu6hu]

Good one

[@nagavedareddy5891]

Huge respect ❤👏

[@abhijitkrao283]

If bool is to be returned instead of pointer, how can that be done ?

[@iamnottech8918]

Recursion or in Iterative when null then false rest case true

[@nileshsinha7869]

Loving the series❤

[@hitheshpk6030]

UNDERSTOOD

[@sujan_kumar_mitra]

Understood

[@rishabhgupta9846]

understood

[@ajayypalsingh]

💚

[@sakshamsharma648]

great

[@SibiRanganathL]

Undetstood

[@AmitKumar-je9qo]

Bhaiya....string ka lecture nhi bnega??

[@t-anime517]

Understood 😊

[@dreamyme543]

Understood:)

[@piyushacharya7696]

reach++

[@momilijaz271]

done

[@p38_amankuldeep75]

💝🧡💝

[@Telugu_europe]

US

[@mohdhammadsiddiqui7598]

Can anyone tell me the problem in this short code on the commented line if i am writing if instead of else if run time error (member access within null pointer ) is coming @takeUforward class Solution { public: TreeNode* searchBST(TreeNode* node, int key) { if(node==NULL) return node; while(node!=NULL && node->val!=key) { if(key>(node->val)) node=node->right; else if(keyval)) node=node->left;//comment } return node; } };

[@psychointruder5203]

because the value of node became null after the if statement in case if value was greater and not found ,and if you try to execute the next if there you dont have a check for the null node thus entering a null pointer, thats the reason i guess

[@mohdhammadsiddiqui7598]

@@psychointruder5203 got thanx , thanx for the comment

[@theenglishclub9970]

what is the corrected code for your above code now? @@mohdhammadsiddiqui7598

[@AbhishekSharma-ip4df]

HEY Striver bro 😓😓please give back the geeks for geeks link beside every question. We have made hundreds of questions on GFG we started coding on GFG because it was in your sheet now if u only remove this how will we revise the question??????????? Now we have to search each question on GFG first then we are doing it, that is taking lot of time. If u have to put coding ninja link put it but don't remove GFG links.🙏🙏🙏🙏🙏🙏🙏🙏 GFG GFG GFG GFG GFG GFG GFG GFG GFG GFG GFG GFG GFG GFG !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

[@KaushikSharma-c3q]

.....................

[@adityapandey23]

Understood

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@pratyush_779]

understood

[@tanishkumar6682]

understood

[@jaiminsolanki5478]

Understood

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@NikhilGupta-zo5jh]

Understood

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@roopeshn3301]

Understood

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@ritikgupta9238]

bro are you getting paid for writing spammy comments?

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@madetolaugh3476]

Thanks bro

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@parthsalat]

Are u using some sort of bot to do this? Pls tell...

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks

[@rishabhkumar8115]

Bro you are doing superb work, very very thanks