Binary Search Trees
•
Notice that a binary tree organizes data in a way
that facilitates searching the tree for a particular
data item.
•
It ends up solving the problems of sorted-
traversal with the linear implementations of the
ADT table.
•
And, if reasonably balanced, it can provide a
logarithmic retrieval, removal, and insertion
performance!
