Please define and explain each prts completely. Thank you. C++ data strucs algorithm question. Will def leave positive rating
1. (a) Briefly describe Abstract Data Types (ADT) or Abstract Data structures in general.
1. (b) Describe the purpose of implementing a Queue, Stack, or Hashmap on an Array or Linked List.
2. Describe why one would implement a Queue, Stack, or Hash map.
3. Why is look-up faster for a Binary Tree then Linked List?