DSA Puzzle

3. One Binary Tree Traversal
7. One of the fastest sorting algorithms with worst case complexity O(n^2)
8. One Open Addressing Collision resolution technique which make use of two hash function
10. Linked List in which last node contain address of first node
11. One type of Hash Function method
15. One application of Greedy Algorithm
19. Parent key value greater than its children
21. One application of Divide and Conquer Strategy
22. Algoritm name which create minimum spanning tree edge by edge
23. Value after evaluation:/*353

1. An efficient algorithm that preprocesses the pattern to construct a "longest proper prefix suffix" (LPS) array
2. One Application of Stack
4. A variant of a binary tree that optimizes traversal
5. One Graph Traversal which uses stack
6. One Linear Data Structure
9. Linked List which contain two pointers
12. single-source shortest path algorithm
13. A self-balancing binary search tree
14. The approach involving a direct character-by-character comparison of the pattern with every possible substring of the text
16. One Non-linear Data Structure
17. FIFO data structure
18. Left child key value smaller than parent value and right key value greater than parent value
20. Given Expression is:abc+/