Across
- 1. data structure used for function calls — (5) — STACK — push/pop; last-in, first-out.
- 3. where each node has at most two children — (10) — BINARYTREE — used for search, heaps (a special kind), etc.
- 5. tree used for fast string lookups — (4) — TRIE — stores characters along paths; excellent for autocomplete.
- 7. binary tree used for priority queues — (4) — HEAP — supports find-max/find-min and efficient insert/delete.
- 8. A ____ is a linear data structure that stores elements in a sequential manner and follows the FIFO (First In, First Out) principle — the element that is inserted first is the one to be removed first.
- 9. A ____is a linear data structure that stores elements in a sequential manner and follows the LIFO (Last In, First Out) principle — the element that is inserted last is the one that is removed first.
Down
- 1. collection accessed by numeric index — (5) — ARRAY — contiguous memory, constant-time index access.
- 2. structure used in breadth-first search — (5) — QUEUE — enqueue at rear, dequeue at front.
- 4. List A ___________ is a linear data structure in which elements, called nodes, are connected using pointers.
- 6. connected by edges, can be directed or undirected — (5) — GRAPH — represents networks, relationships.
- 10. The backbone of sequential data, occupying continuous memory blocks — explain its structure, operations, and limitations.”