Across
- 2. Non-linear structure with root and children
- 4. Follows FIFO principle
- 8. Operation used to add an element
- 9. Follows LIFO principle
- 10. Traversal method: Depth First Search
- 13. Finding an element efficiently
- 15. Connection between two nodes in a graph
Down
- 1. Removing an element
- 3. Technique used for fast key-value lookup
- 5. Traversal method: Breadth First Search
- 6. Linear structure storing same-type elements in contiguous memory
- 7. Dynamic linear structure using pointers
- 11. Arranging elements in order
- 12. Basic unit of tree/graph
- 14. A special complete binary tree