about me

Data Structures

Post replyCan't edit post
Watch topicCan't delete post
Monday, June 28 2004
An overview of Abstract Data Types
Download the document below.
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.
Written in Microsoft Word 2003 and compiled by PDF995
Actions:Post replyWatch topic
No comments.Post reply
Please contact me prior to distributing any files.
Members have extra privileges. You can login or register.
© 2005–2018 P. F. Lammertsma
No members currently online; 0 hits today by 0 unique users