64
Application of BSTs: Sets
Trees provide efficient search.
Sets require efficient search
to find where to insert/delete
to test for set membership
Logical to implement a set ADT via
BSTree
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}