DSA CROSSWORD

1234567891011121314
Across
  1. 2. Left, Right, Root.
  2. 4. Root, Left, Right.
  3. 8. Sorted data structure for fast search.
  4. 9. Removes from front, adds at rear.
  5. 10. MST algorithm using smallest edges.
  6. 14. Left, Root, Right.
Down
  1. 1. Allows insert/delete at both ends.
  2. 3. Search method for ordered tree data
  3. 4. MST algorithm starting from one vertex.
  4. 5. Finds shortest path in weighted graph.
  5. 6. Builds sorted list one element at a time.
  6. 7. Indicates end of a linked list.
  7. 11. Used for function calls and recursion.
  8. 12. Removes top element of a stack.
  9. 13. Represents networks or connections.