(elib.info)Container data types
2 Container Data Types
Container data types are data types which are used to hold and organize
other data. Since lisp is a dynamically typed language, any container
data type can hold any other data type or a mix of other data types.
This is contrary to the case for `C' or `C++' where all data in a
typical container must be of the same type.
As a convention do all names of the functions handling a certain
container data type begin in `<type>-', i.e. the functions implementing
the container data type `foo' all start with `foo-'.
- The Stack data type.
- The Queue data type.
- Doubly Linked List
- The Doubly Linked List Data Type.
- Binary tree
- An ordinary binary tree.
- AVL tree
- A balanced binary tree (AVL tree).
automatically generated by info2www version 188.8.131.52