DSA Puzzle

1234567891011121314151617181920212223
Across
  1. 3. One Binary Tree Traversal
  2. 7. One of the fastest sorting algorithms with worst case complexity O(n^2)
  3. 8. One Open Addressing Collision resolution technique which make use of two hash function
  4. 10. Linked List in which last node contain address of first node
  5. 11. One type of Hash Function method
  6. 15. One application of Greedy Algorithm
  7. 19. Parent key value greater than its children
  8. 21. One application of Divide and Conquer Strategy
  9. 22. Algoritm name which create minimum spanning tree edge by edge
  10. 23. Value after evaluation:/*353
Down
  1. 1. An efficient algorithm that preprocesses the pattern to construct a "longest proper prefix suffix" (LPS) array
  2. 2. One Application of Stack
  3. 4. A variant of a binary tree that optimizes traversal
  4. 5. One Graph Traversal which uses stack
  5. 6. One Linear Data Structure
  6. 9. Linked List which contain two pointers
  7. 12. single-source shortest path algorithm
  8. 13. A self-balancing binary search tree
  9. 14. The approach involving a direct character-by-character comparison of the pattern with every possible substring of the text
  10. 16. One Non-linear Data Structure
  11. 17. FIFO data structure
  12. 18. Left child key value smaller than parent value and right key value greater than parent value
  13. 20. Given Expression is:abc+/