Skip to main content

Test yourself · Book 12

Data Structures quiz

Each question is a definition from this book with its term hidden. Pick the right term out of four, or flip through flashcards.

Pages
36
Your best
–
Rounds played
0
Pages you know
0/36
How to practice
Round length

Pages in this quiz

Your last answer for each page. Kept only in this browser.

  • 0 known
  • 0 to review
  • 36 not asked yet
  1. Adjacency List1
  2. B-Tree2
  3. Backtracking3
  4. Balanced Tree4
  5. Binary Search5
  6. Binary Search Tree6
  7. Bloom Filter7
  8. Breadth-First Search8
  9. Bubble Sort9
  10. Depth-First Search10
  11. Deque11
  12. Dijkstra's Algorithm12
  13. Divide and Conquer13
  14. Dynamic Programming14
  15. Graph15
  16. Greedy Algorithm16
  17. Hash Collision17
  18. Hash Table18
  19. Heap19
  20. Insertion Sort20
  21. Linear Search21
  22. Linked List22
  23. LRU Cache23
  24. Merge Sort24
  25. Priority Queue25
  26. Queue26
  27. Quicksort27
  28. Set28
  29. Sliding Window29
  30. Sorting Algorithm30
  31. Stack31
  32. Topological Sort32
  33. Tree33
  34. Trie34
  35. Two Pointers35
  36. Union-Find36
Read a random page
Open today's review
Switch to the dark theme
Read this page in Türkçe

More

Settings