Computing
Data Structures
Train on Data Structures with 315 published problems. Preview a problem, explore the course outline, and work through one problem at a time.
Training
Start training
Course and path
Available problems completed
View progressLoading course progress…
Preview a course problem
See a problem from Data Structures before you begin.
Course topics
Course topics
Abstract data types, representation, and invariants
Arrays, linked structures, stacks, queues, and amortization
Search trees and balanced trees
Hash tables and probabilistic performance
Heaps, priority queues, and disjoint sets
Graph representations and traversals
Practice problems
Try a few Data Structures problems, each with a hint.
- Let V be a dynamic array of n elements stored in a buffer of capacity c, with the… Free with an accountAbstract data types, representation, and invariants
- A ring buffer (circular array) of fixed capacity C ≥ 1 stores a sequence of at most C… Free with an accountAbstract data types, representation, and invariants
- Let L be the doubly linked list with values [10, 20, 30, 40, 50], and let I be a… Arrays, linked structures, stacks, queues, and amortization
- Consider BST deletion of a node z Search trees and balanced trees
- Let T be a BST whose nodes contain only key, left, and right fields (no parent… Search trees and balanced trees
- Consider a hash table T of size m = 11 that resolves collisions by chaining Hash tables and probabilistic performance
- Throw n balls independently and uniformly into n bins Hash tables and probabilistic performance
- `Bubble-Down`(A,i,n) is specified as follows on a 1-based array that is a complete… Heaps, priority queues, and disjoint sets
- The fat-node method of partial persistence stores, in each field of each node, a… Graph representations and traversals
- A duplicate minimum must sit on the min-stack, or one pop forgets the other Arrays, linked structures, stacks, queues, and amortization