Data structures: Binary Search Tree
See complete series on data structures here:
• Data structures
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: http://www.mycodeschool.com
Like us on Facebook: / mycodeschool
Follow us on twitter: / mycodeschool
