Some data structures implemented in Oz:
- Stack (create a new stack, push and pop elements, see its size, sum the elements and check if it's empty)
- Dictionary (create a new dictionary, insert elements, get element by key, see its size, check if it's empty and see all its keys)
- Binary tree [in progress]
- Queue [in progress]
- List
(more comming soon...)
Reference: book "Concepts, Techniques and Models of Computer Programming" by Peter Van Roy and Seif Harid