Other
Interactive Data Structure Visualizations: Binary Tree Traversals
A great visualization / animation tool that illustrates the different traversal algorithms used with binary trees.
University of Auckland School of Computer Science
Morris: Lists
A description of lists as an abstract data type.
University of Auckland School of Computer Science
Morris: Objects and Ad Ts
A description of objects and abstract data types.
Other
Abstraction and Abstract Data Types
These course notes distinguish between an abstraction and abstract data types (ADT). Follow further links to examples of ADTs- stacks and lists.
University of Auckland School of Computer Science
Morris: Heaps
A description of the heap data structure, its purpose, and methods used to manipulate data in a heap.
University of Auckland School of Computer Science
Morris: Queues
A brief description of the queue abstract data type.
University of Auckland School of Computer Science
Morris: Priority Queue
A brief description of the priority queue abstract data type.
Other
Priority Queues and the Stl
A description of the Priority Queue data structure and its implementation in Visual C++.
National Institute of Standards and Technology (NIST)
Dictionary of Algorithms and Data Structures: Linked List
A description of the linked list data structure.
National Institute of Standards and Technology (NIST)
Dictionary of Algorithms and Data Structures: Heap
The DADS definition of the heap abstract data type.
National Institute of Standards and Technology (NIST)
Dictionary of Algorithms and Data Structures: Binary Tree
The DADS description of the binary tree abstract data structure.
