Application of BSTs: Sets (cont)
Assuming we have Tree implementation
- which precludes duplicate key values
- which implements insertion, search, deletion
then Set implementation is
-
addToSet(Set,Item) ≡ TreeInsert(Tree,Item)
-
removeFromSet(Set,Item) ≡ TreeDelete(Tree,Item.Key)
-
memberOfSet(Set,Item) ≡ TreeSearch(Tree,Item.Key)
|
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}