CIS 321 Assignment 6
- Write a document to summarize the data structures we have learned so far. The minimum set includes array lists, single-linked lists, double-linked lists, stacks, queues, priority queues, binary trees, binary search trees, heaps, sets, maps, and hash tables. For each data structure, please include at least a basic definition, the major operations such as "insert" etc., a description of possible implementation methods, and real-life application examples. You can use a table for this assignment. List any supplemental materials you use as your references. Please use a text editor such as Word.
- Paste your document as the email message or send your document as an email attachment to zwang@shepherd.edu by 11pm on 4/18. Please write CIS 321 and your full name on the subject line of your email.