DS

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