Ways of organizing data. Play Data Structures trivia solo to sharpen your knowledge, or challenge a friend head-to-head in Trivia Tango — every question comes with an explanation so you learn as you play. Questions span every level, from easy warm-ups to expert-level stumpers, so there's a real challenge here however much you already know.
A mix of easy, medium and hard — questions run from warm-up to expert, so there's a real challenge at every level. Think you know the answers? Play to find out.
In stack operations, this term describes adding an element to the top of the stack.
Difficulty: EasyThis self-balancing binary search tree maintains balance using a balance factor of -1, 0, or 1 at each node.
Difficulty: MediumThis text transformation reversibly permutes characters to group similar ones together, aiding compression.
Difficulty: HardIn stack operations, this term describes removing an element from the top of the stack.
Difficulty: EasyThis problem occurs in linear probing when filled slots clump together, degrading hash table performance.
Difficulty: MediumThis technique searches multiple nested data structures by sharing search state across levels.
Difficulty: HardIn queue operations, this term describes adding an element to the back of the queue.
Difficulty: EasyThis operation restores heap property by moving a node up toward the root after insertion.
Difficulty: Medium