Uploaded January 2014 | Updated September 2026, 2 weeks ago

---

See complete series on data structures here:
youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P

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.

For practice problems and more, visit: mycodeschool.com

Like us on Facebook: facebook.com/MyCodeSchool

Follow us on twitter: twitter.com/mycodeschool