Field Guide to Data Structures

• For each of the data structures listed below, give an example application that serves to highlight its strength. Justify your choice by appealing to the complexity of major operations, i.e., inserting, removing and lookup. You do not have to write a lot for each of the items below. The more concise, the better.
• Feel free to work on this assignment in pairs.
• Knowledge Server
  • ArrayList
  • Linked list
  • Skiplist
  • Stack
  • Queue
  • Priority queue
  • AVL tree
  • Red Black tree
  • Graph
  • Hashtable
  • HashSet
  • HashMap