1. min-heap - ANS☑☑---a tree that maintains the simple property that a node's key
is less than or equal to the node's childrens' keys
2. graph - ANS☑☑---data structure for representing connections among items, and
consists of vertices connected by edges
3. vertice - ANS☑☑---part of a graph the represents an item in a graph
4. edge - ANS☑☑---part of a graph that represents a connection between to
vertices in a graph
5. what is an advantage of a linked list over an array? - ANS☑☑---when inserting a
new item at the beginning it causes no shift to the data
6. ADT (Abstract data Type) - ANS☑☑---data type described by predefined user
operations, such as "insert data at rear", without indication how each operation is
implemented
7. list - ANS☑☑---ADT for holding ordered data
8. stack - ANS☑☑---ADT which items are only inserted on or removed from the
top of a stack
, 9. record - ANS☑☑---data structure that stores subitems, with a name associated
with each subitem
10. array - ANS☑☑---a data structure that stores an ordered list of items, with each
item is directly accessible by a positional index homogeneous data elements
11. linked list - ANS☑☑---data structure that stores *ordered* list of items in nodes,
where each node stores data and has a pointer to the next node; can have
multiple subitems
12. binary tree - ANS☑☑---A data structure that consists of nodes, with one root
node at the base of the tree, and two nodes (left child and right child) extending
from the root, and from each child node can have no children, single left or right,
or both right and left
13. hash table - ANS☑☑---data structure that stores *unordered* items by mapping
(or hashing) each item to a location in an array
14. max-heap - ANS☑☑---a tree that maintains the simple property that a node's
key is greater than or equal to the node's childrens' keys
15. LIFO
16. Queue - ANS☑☑---ADT in which items are inserted at the end of the queue and
removed from the front of the queue
17. FIFO
is less than or equal to the node's childrens' keys
2. graph - ANS☑☑---data structure for representing connections among items, and
consists of vertices connected by edges
3. vertice - ANS☑☑---part of a graph the represents an item in a graph
4. edge - ANS☑☑---part of a graph that represents a connection between to
vertices in a graph
5. what is an advantage of a linked list over an array? - ANS☑☑---when inserting a
new item at the beginning it causes no shift to the data
6. ADT (Abstract data Type) - ANS☑☑---data type described by predefined user
operations, such as "insert data at rear", without indication how each operation is
implemented
7. list - ANS☑☑---ADT for holding ordered data
8. stack - ANS☑☑---ADT which items are only inserted on or removed from the
top of a stack
, 9. record - ANS☑☑---data structure that stores subitems, with a name associated
with each subitem
10. array - ANS☑☑---a data structure that stores an ordered list of items, with each
item is directly accessible by a positional index homogeneous data elements
11. linked list - ANS☑☑---data structure that stores *ordered* list of items in nodes,
where each node stores data and has a pointer to the next node; can have
multiple subitems
12. binary tree - ANS☑☑---A data structure that consists of nodes, with one root
node at the base of the tree, and two nodes (left child and right child) extending
from the root, and from each child node can have no children, single left or right,
or both right and left
13. hash table - ANS☑☑---data structure that stores *unordered* items by mapping
(or hashing) each item to a location in an array
14. max-heap - ANS☑☑---a tree that maintains the simple property that a node's
key is greater than or equal to the node's childrens' keys
15. LIFO
16. Queue - ANS☑☑---ADT in which items are inserted at the end of the queue and
removed from the front of the queue
17. FIFO
