Across
- 5. Efficient sorting algorithm using partitioning
- 8. Stable sorting algorithm using divide and conquer
- 10. Graph traversal using recursion or stack
- 12. Collision resolution using a second hash function
- 18. FIFO structure used in scheduling
- 20. Search that divides a sorted list in halves
- 21. Collection of nodes where each node points to the next
- 22. Tree traversal using a queue to visit level by level
- 26. Graph traversal using a queue
- 29. Sort that selects the smallest element each pass
- 31. Linked list with pointers to both previous and next nodes
- 34. Efficient for small or nearly sorted arrays
- 35. Tree traversal that visits nodes in Root-Left-Right order
- 36. Graph where edges do not have direction
- 37. Tree traversal that visits nodes in Left-Root-Right order
- 38. Search technique that checks every element
Down
- 1. Queue that connects the rear back to the front to save space
- 2. Matrix used to represent graph edge connections
- 3. Queue where elements are served based on priority
- 4. Operation that adds an element to the top
- 6. Sort that swaps adjacent elements repeatedly
- 7. LIFO structure used for expression evaluation
- 9. Function used to convert key into index in hashing
- 11. Operation that removes an element from the front of a queue
- 13. First node in a linked list
- 14. Inorder traversal of BST gives this type of sequence
- 15. Sort that uses a binary heap structure
- 16. When two keys map to the same hash index
- 17. Node in a tree that has at least one child
- 19. Operation that adds an element to the rear of a queue
- 23. Time complexity of linear search in the worst case
- 24. A linked list where the last node connects to the first
- 25. Tree traversal that visits nodes in Left-Right-Root order
- 27. Operation that removes the top element
- 28. Node in a tree that has no children
- 30. Collision handling in hashing using linked lists
- 32. Tree with the property Left < Root < Right
- 33. Operation to add a node while maintaining BST rules