Across
- 2. Technique to convert data into a fixed-size key or index
- 5. A method to solve problems by storing solutions to subproblems
- 8. Depth First Search algorithm for graph traversal
- 9. A function calling itself directly or indirectly
- 10. Abstract Data Type that defines operations of a queue
- 11. Breadth First Search algorithm for graph traversal
- 13. A linear data structure following Last In First Out principle
- 14. Visiting all nodes in a data structure
Down
- 1. A search algorithm that divides the array in half each step
- 2. A special tree-based structure used for priority queues
- 3. A linear data structure where each element points to the next
- 4. A non-linear hierarchical data structure with nodes and edges
- 6. A divide and conquer sorting algorithm with O(n log n) complexity
- 7. A collection of nodes connected by edges, can be directed or undirected
- 10. A linear data structure that operates in First In First Out order
- 12. A collection of elements identified by index