Fai

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