Binary Search Tree | Set 1 (Search and Insertion) | GeeksforGeeks

This video is contributed by Ishant Periwal.

Music: Cylinder Three - Chris Zabriskie

[waqarahmad]

Thanks for the great work. A recommendation, a voiceover would be more helpful than distracting music.

[vaishnavim]

Extremely helpful, quality resources!! A reliable go to destination for a good understanding!

[jojolynchgaming]

Music was good but please guide orally during the videos.

[santoshmk]

Nice video.. understood insertion and search clearly.. keep up the good work!

[nands]

After watching this video I stopped watching the other data structures videos and started searching for background beat songs.😌

[Annajiraochalla]

Fast Explanation. Helped me a lot... Thank you

[dydx]

okay here 2:26 is there any way to stop as soon as key found because because before returning ... it keeps on popping watever calls in stack

[gitanshugupta]

Awesome presentation....which application do you all use for this animation ??

[alaskafiedler]

In the pseudocode what is meant by the arrow between node -> key, node->left, and node->right? I must be missing something v simple...

[kashishgupta]

in search bst if key is not there or if key is there, it will do nothing. it will just return root.
if that is so then what is the purpose of searching?

[Stephanie-znjt]

what is the new music added to this? it's not the listed sky high

[kittipobkomjaturut]

In case of insertion, what value should be returned when there is a redundancy node ?

[PythonisLove]

Marvelous... this is enough for a healthy revise before exam

[Mersal-ujnh]

Nice video but Background music is so annoying :(

[mnarjb]

what if I have a key in the same function?

[diwyanshutomar]

GeeksForGeeks your tutorials are very nice, but there is one big problem, the background music it suits more for gym workout :), For new people to follow your tuts, i request you to please let the visitor focus on the content, as it gets distracting to understand a concept out of serious topic like data structure

[tanchienhao]

may I know if the time complexity for insertion is O(n) and searching is O(n)? :D great video, thanks!