Learn to say popular computer science data structure names correctly.
0 / 5 completed
1 / 5
How is a Trie (tree-like data structure used for fast prefix-based string lookups) correctly pronounced?
A Trie is pronounced 'TRY' — deliberately, to distinguish it in speech from the unrelated 'tree' data structure. In a technical interview: "Trie let us autocomplete the search box against a hundred thousand words in constant time per character."
2 / 5
How is a Deque (double-ended queue supporting insertion and removal at both ends) correctly pronounced?
A Deque is pronounced 'DEK' — rhymes with 'deck', not spelled out letter by letter. In a technical interview: "Deque let us push new jobs onto the front while a worker still popped finished ones off the back."
3 / 5
How is a Heap (tree-based data structure that keeps the minimum or maximum element at the root) correctly pronounced?
A Heap is pronounced 'HEEP' — exactly like the everyday word for a pile, one syllable. In a technical interview: "Heap gave us the next-lowest-priority task in logarithmic time, no matter how many jobs were queued."
4 / 5
How is a B-tree (balanced tree data structure widely used in databases and filesystems) correctly pronounced?
A B-tree is pronounced 'BEE-tree' — the letter 'B' plus 'tree', both spoken plainly. In a technical interview: "B-tree kept the index balanced, so a lookup on ten million rows still took only a handful of disk reads."
5 / 5
How is a Bloom filter (probabilistic data structure used to test set membership) correctly pronounced?
A Bloom filter is pronounced 'BLOOM FIL-tur' — named after its inventor Burton Bloom, plus the everyday word 'filter'. In a technical interview: "Bloom filter let us skip the expensive disk lookup for the vast majority of keys that definitely weren't present."