This 29-page document is an overview of a number of basic abstract data types, including: stack, queue, vector, list, sequence, tree, binary tree, priority queue, heap, map, hash table, dictionary, look-up table and skip list.
Also, it describes the workings of the following algorithms: Bubble Sort, Preorder Traversal, Postorder Traversal, Inorder Traversal, Euler Tour Traversal, Last Node in Heap, Upheap, Downheap and Binary Search.
The listed data types and algorithms are described in great detail, although not all material initially planned is covered.
Includes a table of contents and index. |
Please contact me prior to distributing any files.