Rarest Data Structure — All 129 Answers Ranked by Rarity
Rarity comes from English Wikipedia pageviews over the last 12 months, not from player answers. 129 answers count for “Name a data structure”. Ranked rows run from the fewest pageviews to the most pageviews. Linear data set and Program Memory Area tie for rarest (Legendary, 100 points), with 77 English Wikipedia pageviews, last 12 months each.
Play this prompt
“Name a data structure” accepts 129 answers. Ranked rows are ordered by pageviews, fewest first. A guess counts when it matches a listed name or an alias stored on that name.
These aliases count: Linear DataSet for Linear data set, feature for Feature data, block chain for Blockchain, and RB tree for Red–black tree. Block chain scores as Blockchain. Block is a separate answer. RB tree scores as Red–black tree. Tree is a separate answer.
Binary is not an accepted answer on its own. The names that include it are Binary heap and Binary search tree. Black is not an accepted answer on its own. The names that include it are Left-leaning red–black tree and Red–black tree.
On this list, the high scores among ranked answers are the names with the fewest pageviews: Linear data set, Program Memory Area, and Compressed cover tree (Legendary, 100 points, 9 in this tier). Merkle tree, Red–black tree, and Blockchain are the most-pageviews end (Common, 5 points).
The answers with the most pageviews include Merkle tree, Red–black tree, and Blockchain (Common, 5 points, 26 in this tier). They have the most English Wikipedia pageviews, last 12 months. The answers with the fewest pageviews include Linear data set, Program Memory Area, and Compressed cover tree (Legendary, 100 points, 9 in this tier). They have the fewest, so they are the high scores on this ranking.
Quick answer
English Wikipedia pageviews, last 12 months (November 2025–October 2026). Each number is the sum of those 12 months, not a count of player answers. Source: Wikidata + Wikipedia pageviews (2026-10).
Data updated October 2026.
Report a wrong answer Data updates
The rarity spread
129 accepted answers
How this prompt’s accepted answers are distributed across the six scoring tiers.
-
Legendary 9 answers
-
Epic 17 answers
-
Rare 26 answers
-
Uncommon 25 answers
-
Familiar 26 answers
-
Common 26 answers
Ranked answers
| Rank | Answer | Tier | Rarity | English Wikipedia pageviews, last 12 months | Wikipedia article |
|---|---|---|---|---|---|
| 1 | Linear data set | | Tied for rarest | 77 | Linear data set |
| 2 | Program Memory Area | | Tied for rarest | 77 | Program Memory Area |
| 3 | Compressed cover tree | | Fewer pageviews than 98% | 154 | Compressed cover tree |
| 4 | User Electronic Signature | | Fewer pageviews than 98% | 164 | User Electronic Signature |
| 5 | Addressable heap | | Fewer pageviews than 97% | 187 | Addressable heap |
| 6 | Active data structure | | Fewer pageviews than 96% | 193 | Active data structure |
| 7 | Shadow heap | | Fewer pageviews than 95% | 250 | Shadow heap |
| 8 | Feature data | | Fewer pageviews than 95% | 324 | Feature data |
| 9 | Relaxed k-d tree | | Fewer pageviews than 94% | 329 | Relaxed k-d tree |
| 10 | Fieldtree | | Fewer pageviews than 93% | 333 | Fieldtree |
| 11 | Job File Table | | Fewer pageviews than 92% | 367 | Job File Table |
| 12 | Bridge protocol data unit | | Fewer pageviews than 91% | 386 | Bridge protocol data unit |
| 13 | Interval union-split-find | | Fewer pageviews than 91% | 425 | Interval union-split-find |
| 14 | Shared snapshot objects | | Fewer pageviews than 90% | 453 | Shared snapshot objects |
| 15 | Recordset | | Fewer pageviews than 89% | 454 | Recordset |
| 16 | Kinetic heap | | Fewer pageviews than 88% | 455 | Kinetic heap |
| 17 | Block allocation map | | Fewer pageviews than 88% | 472 | Block allocation map |
| 18 | C-trie | | Fewer pageviews than 87% | 506 | C-trie |
| 19 | Mergeable heap | | Fewer pageviews than 86% | 605 | Mergeable heap |
| 20 | Retroactive data structure | | Fewer pageviews than 85% | 622 | Retroactive data structure |
| 21 | Unit Control Block | | Fewer pageviews than 84% | 685 | Unit Control Block |
| 22 | Data Control Block | | Fewer pageviews than 84% | 694 | Data Control Block |
| 23 | Conc-tree list | | Fewer pageviews than 83% | 715 | Conc-tree list |
| 24 | (a,b)-tree | | Fewer pageviews than 82% | 768 | (a,b)-tree |
| 25 | Zero page | | Fewer pageviews than 81% | 870 | Zero page (CP/M) |
| 26 | Exponential tree | | Fewer pageviews than 81% | 946 | Exponential tree |
| 27 | Stream | | Fewer pageviews than 80% | 948 | Stream (abstract data type) |
| 28 | Priority search tree | | Fewer pageviews than 79% | 1,083 | Priority search tree |
| 29 | Level set | | Fewer pageviews than 78% | 1,086 | Level set (data structures) |
| 30 | Oblivious data structure | | Fewer pageviews than 77% | 1,096 | Oblivious data structure |
| 31 | Kinetic data structure | | Fewer pageviews than 77% | 1,137 | Kinetic data structure |
| 32 | B-heap | | Fewer pageviews than 76% | 1,221 | B-heap |
| 33 | Substring index | | Fewer pageviews than 75% | 1,244 | Substring index |
| 34 | Prefix hash tree | | Fewer pageviews than 74% | 1,316 | Prefix hash tree |
| 35 | Radix heap | | Fewer pageviews than 73% | 1,366 | Radix heap |
| 36 | Beap | | Fewer pageviews than 73% | 1,388 | Beap |
| 37 | Search data structure | | Fewer pageviews than 72% | 1,462 | Search data structure |
| 38 | Cover tree | | Fewer pageviews than 71% | 1,641 | Cover tree |
| 39 | Line | | Fewer pageviews than 70% | 1,691 | Line (text file) |
| 40 | Bidirectional map | | Fewer pageviews than 70% | 1,735 | Bidirectional map |
| 41 | Rendezvous | | Fewer pageviews than 69% | 1,941 | Rendezvous (Plan 9) |
| 42 | Palindrome tree | | Fewer pageviews than 68% | 2,237 | Palindrome tree |
| 43 | Hash trie | | Fewer pageviews than 67% | 2,310 | Hash trie |
| 44 | Skip graph | | Fewer pageviews than 66% | 2,385 | Skip graph |
| 45 | Hash tree | | Fewer pageviews than 66% | 2,438 | Hash tree (persistent data structure) |
| 46 | Sorted array | | Fewer pageviews than 65% | 2,472 | Sorted array |
| 47 | Edge list | | Fewer pageviews than 64% | 2,492 | Edge list |
| 48 | Thread control block | | Fewer pageviews than 63% | 2,531 | Thread control block |
| 49 | File Control Block | | Fewer pageviews than 63% | 2,536 | File Control Block |
| 50 | Association list | | Fewer pageviews than 62% | 2,540 | Association list |
| 51 | Implicit data structure | | Fewer pageviews than 61% | 2,594 | Implicit data structure |
| 52 | Hollerith constant | | Fewer pageviews than 60% | 2,704 | Hollerith constant |
| 53 | Iliffe vector | | Fewer pageviews than 59% | 2,773 | Iliffe vector |
| 54 | Concurrent data structure | | Fewer pageviews than 59% | 2,776 | Concurrent data structure |
| 55 | Partition table | | Fewer pageviews than 58% | 2,834 | Partition table |
| 56 | Fractal tree index | | Fewer pageviews than 57% | 2,937 | Fractal tree index |
| 57 | Scan-Line Interleave | | Fewer pageviews than 56% | 3,042 | Scan-Line Interleave |
| 58 | Hashed array tree | | Fewer pageviews than 56% | 3,135 | Hashed array tree |
| 59 | Matrix representation | | Fewer pageviews than 55% | 3,339 | Matrix representation |
| 60 | Linked data structure | | Fewer pageviews than 54% | 3,474 | Linked data structure |
| 61 | Program Segment Prefix | | Fewer pageviews than 53% | 3,563 | Program Segment Prefix |
| 62 | Judy array | | Fewer pageviews than 52% | 3,638 | Judy array |
| 63 | Counting Bloom filter | | Fewer pageviews than 52% | 3,830 | Counting Bloom filter |
| 64 | Geodatabase | | Fewer pageviews than 51% | 3,913 | Geodatabase (Esri) |
| 65 | Ternary search tree | | Fewer pageviews than 50% | 3,922 | Ternary search tree |
| 66 | Use-define chain | | Fewer pageviews than 49% | 4,179 | Use-define chain |
| 67 | BIOS parameter block | | Fewer pageviews than 48% | 4,296 | BIOS parameter block |
| 68 | Packetized elementary stream | | Fewer pageviews than 48% | 4,354 | Packetized elementary stream |
| 69 | Left-leaning red–black tree | | Fewer pageviews than 47% | 4,396 | Left-leaning red–black tree |
| 70 | Task state segment | | Fewer pageviews than 46% | 4,803 | Task state segment |
| 71 | Memory map | | Fewer pageviews than 45% | 5,155 | Memory map |
| 72 | Purely functional data structure | | Fewer pageviews than 45% | 5,298 | Purely functional data structure |
| 73 | Scapegoat tree | | Fewer pageviews than 44% | 5,606 | Scapegoat tree |
| 74 | Extent | | Fewer pageviews than 43% | 5,614 | Extent (file systems) |
| 75 | Range tree | | Fewer pageviews than 42% | 6,314 | Range tree |
| 76 | System image | | Fewer pageviews than 41% | 6,697 | System image |
| 77 | Branching | | Fewer pageviews than 41% | 6,801 | Branching (version control) |
| 78 | Passive data structure | | Fewer pageviews than 40% | 6,856 | Passive data structure |
| 79 | Succinct data structure | | Fewer pageviews than 39% | 6,875 | Succinct data structure |
| 80 | Summed-area table | | Fewer pageviews than 38% | 7,700 | Summed-area table |
| 81 | Zipper | | Fewer pageviews than 38% | 7,871 | Zipper (data structure) |
| 82 | 2–3–4 tree | | Fewer pageviews than 37% | 8,705 | 2–3–4 tree |
| 83 | Triangulated irregular network | | Fewer pageviews than 36% | 8,894 | Triangulated irregular network |
| 84 | 2–3 tree | | Fewer pageviews than 35% | 9,421 | 2–3 tree |
| 85 | Nested set model | | Fewer pageviews than 34% | 9,830 | Nested set model |
| 86 | Process control block | | Fewer pageviews than 34% | 10,144 | Process control block |
| 87 | Symbol table | | Fewer pageviews than 33% | 11,816 | Symbol table |
| 88 | Union type | | Fewer pageviews than 32% | 12,001 | Union type |
| 89 | Block | | Fewer pageviews than 31% | 12,587 | Block (data storage) |
| 90 | Cons | | Fewer pageviews than 31% | 12,740 | Cons |
| 91 | List | | Fewer pageviews than 30% | 13,113 | List (abstract data type) |
| 92 | Frame | | Fewer pageviews than 29% | 14,218 | Frame (networking) |
| 93 | Continuation | | Fewer pageviews than 28% | 15,702 | Continuation |
| 94 | Dynamic array | | Fewer pageviews than 27% | 17,073 | Dynamic array |
| 95 | Semantic triple | | Fewer pageviews than 27% | 17,527 | Semantic triple |
| 96 | Min-max heap | | Fewer pageviews than 26% | 17,677 | Min-max heap |
| 97 | OLAP cube | | Fewer pageviews than 25% | 17,860 | OLAP cube |
| 98 | Bit field | | Fewer pageviews than 24% | 18,000 | Bit field |
| 99 | Devicetree | | Fewer pageviews than 23% | 19,233 | Devicetree |
| 100 | Splay tree | | Fewer pageviews than 23% | 23,181 | Splay tree |
| 101 | Persistent data structure | | Fewer pageviews than 22% | 23,961 | Persistent data structure |
| 102 | Adjacency list | | Fewer pageviews than 21% | 25,189 | Adjacency list |
| 103 | Graph | | Fewer pageviews than 20% | 26,789 | Graph (abstract data type) |
| 104 | Segment tree | | Fewer pageviews than 20% | 27,100 | Segment tree |
| 105 | Page table | | Fewer pageviews than 19% | 28,930 | Page table |
| 106 | Intermediate representation | | Fewer pageviews than 18% | 30,219 | Intermediate representation |
| 107 | Polygon mesh | | Fewer pageviews than 17% | 31,840 | Polygon mesh |
| 108 | Database index | | Fewer pageviews than 16% | 33,389 | Database index |
| 109 | Associative array | | Fewer pageviews than 16% | 34,133 | Associative array |
| 110 | Fibonacci heap | | Fewer pageviews than 15% | 35,007 | Fibonacci heap |
| 111 | Tree | | Fewer pageviews than 14% | 38,281 | Tree (abstract data type) |
| 112 | R-tree (R-tree) | | Fewer pageviews than 13% | 47,645 | R-tree |
| 113 | Log-structured merge-tree | | Fewer pageviews than 13% | 48,424 | Log-structured merge-tree |
| 114 | Inode | | Fewer pageviews than 12% | 48,749 | Inode |
| 115 | Binary heap | | Fewer pageviews than 11% | 48,942 | Binary heap |
| 116 | Array | | Fewer pageviews than 10% | 49,714 | Array (data structure) |
| 117 | Call stack | | Fewer pageviews than 9% | 51,206 | Call stack |
| 118 | Quadtree | | Fewer pageviews than 9% | 61,665 | Quadtree |
| 119 | Binary search tree | | Fewer pageviews than 8% | 76,868 | Binary search tree |
| 120 | Stack | | Fewer pageviews than 7% | 76,962 | Stack (abstract data type) |
| 121 | Circular buffer | | Fewer pageviews than 6% | 79,532 | Circular buffer |
| 122 | K-d tree | | Fewer pageviews than 6% | 79,678 | K-d tree |
| 123 | Disjoint-set data structure | | Fewer pageviews than 5% | 80,973 | Disjoint-set data structure |
| 124 | Conflict-free replicated data type | | Fewer pageviews than 4% | 100,139 | Conflict-free replicated data type |
| 125 | B-tree | | Fewer pageviews than 3% | 140,041 | B-tree |
| 126 | Hash table | | Fewer pageviews than 2% | 145,382 | Hash table |
| 127 | Merkle tree | | Fewer pageviews than 2% | 205,305 | Merkle tree |
| 128 | Red–black tree | | Fewer pageviews than 1% | 248,474 | Red–black tree |
| 129 | Blockchain | | Most common | 406,624 | Blockchain |
FAQ
Do all 129 answers count?
Yes. The table is the accepted set for “Name a data structure”. A name that is not listed, and is not a stored alias, does not count.
Which names have the most pageviews?
The answers with the most pageviews include Merkle tree, Red–black tree, and Blockchain (Common, 5 points, 26 in this tier).
How do you score high on this prompt?
On this list, the high scores among ranked answers are the names with the fewest pageviews: Linear data set, Program Memory Area, and Compressed cover tree (Legendary, 100 points, 9 in this tier). Merkle tree, Red–black tree, and Blockchain are the most-pageviews end (Common, 5 points).
Play
Unlimited mode uses this prompt. A rarer correct answer scores more.
More Science prompts
- Name a Fields medalist Rarest answer: Jesse Douglas
- Name a galaxy in the Local Group Rarest answer: Mini Magellanic Cloud
- Name a gemstone Rarest answer: Trapiche gemstone
- Name a hormone Rarest answer: Luteal Hormone
- Name a human bone Rarest answer: Intermediate phalanges
- Name a human chromosome Rarest answer: Chromosome 14
Sources
Recorded source: Wikidata + Wikipedia pageviews (2026-10). The pageview column is English Wikipedia pageviews, last 12 months (November 2025–October 2026), added across those months. Inside this prompt, more of those pageviews means a more common rank. This is not a count of player answers. The source names Wikidata as where the answer list was compiled. The Wikipedia article column links an answer only when an English Wikipedia title is stored on it.