Data structures: Binary Search Tree

See complete series on data structures here:

In this lesson, we have discussed binary search tree data structure. Binary search is an efficient data structure in which we can store data to get search, insertion and deletion, all in O(log n) running time. We have drawn comparison of Binary search tree with arrays and linked list and explained this concept in detail.

[supastar]

I absolutely LOVE how you started off by showing the common operations and their time analysis for Arrays and Linked lists before introducing BST. Sometimes you just know these things but not exactly WHY the need for them in the first place. Thanks.

[nikolajnguyen]

It still amazes me, that a video 9 years ago which simply uses pencil drawing for illustration and explanation, can explain a topic so well,
sometimes we tend to overcomplicate stuff, when really you could just sit down and explain it with pen and paper.

Thank you for the explanation, and i want to let you know, ever after a decade, you still help young programmers get better.
Love your videoes!

[ajaysabarish]

yours is perhaps the only lectures series that doesn't confuse students with unnecessary things, it is really great, thank you very much

[ccossmin]

Honestly this was one of the best, if not *the* best algorithm exploration I've ever seen. Congratulations to the author(s)!

[ArpanPathak]

You are the best teacher in this planet

[leixun]

*My takeaways:*
1. Computation complexity comparison of searching/inserting/removing elements in Array (sorted, unsorted), linked list and binary search tree (balanced) 0:00 - 9:28
2. What is balanced binary search tree and why it is efficient for searching 9:30
3. Unbalanced binary search tree 16:22
3. Insert and remove elements in balanced binary search tree is also efficient 17:44

[temitopeoyeyemi]

if you have exam this morning skip and start at 9:53

[brianspain]

You sir are an incredible teacher. Your delivery and pace is so easy to understand. Thank you for the great content.

[vishalsnsingh]

I left my college lectures to study this video, wonderful and easy explain!

[dineshbhonsle]

Very crisp and clear, it was 16 years since i graduated and never brushed up on this topic. Excellent !

[moiqubal]

You give an excellent lecture. Please don't change a thing.

[WolfKelley]

Hands down the best and most clear cut example on binary search tree so far. Thank you.

[evanl]

Excellent explanation. I wish my university classes were this concise and well-explained.

[malkavian]

One of the best explanations I've seen on any subject, I understand this perfectly now. Thank you!

[GintoPlays]

This is a really concise and clear explanation of a BST. Thank you!

[tutorialshub]

Dear brother, your lectures have indeed helped me a lot for my university studies. 

Thank you so much for putting up this selfless effort. 

May God reward you with goodness. 

[liliayu]

It's very helpful, Thank you for your explanation

[joeybing]

simply the best. I'd say your method of explanation is great.

[ananyadixit]

I literally loved the way you turn things and make it go concrete in our head..! You are surely a life saviour 🙏

[megr]

One of the best videos I've seen regarding data structures. Thanks for sharing the knowledge.