Practice problems with hints and solutions · ProofAnvil Browsing still works.Sign in to use progress, saved problems and private labels. Problem search and previews remain available. Progress labels
IndependentSolved with helpIncorrect / unresolvedDraft in progressNot attemptedReview due
Problem results
ProblemCourse & topicStatus
Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Graph RepresentationsData Structures Problem Solving
Graph representations and traversalsData Structures · Mixed review
—Showing 24 of 50 matching problems.
The fat-node method of partial persistence stores, in each field of each node, a chronological list of (version…
Design a fully persistent array A[1..n] of integers.
A treap stores distinct keys in a binary tree.
Let K be a set of n distinct keys and let π be a bijection from K to {1,…,n} used as priorities (smaller… Start with an empty treap and insert the keys 8,3,10,1,6,14,4,7,13 in that order, using the respective priorities…
A skip list on n distinct keys stores each key in a tower of geometrically many forward pointers.
In the skip list of Problem 256 with p=1/2, let M be the maximum tower height among n keys (sentinels excluded).
A random BST on n distinct keys is the tree obtained by inserting the keys in uniformly random order into an…
Let H be a universal family of hash functions from a universe U into {0,1,…,m−1}: for every… Cuckoo hashing uses two tables T0[0..m−1] and T1[0..m−1] and two hash functions h0,h1:U→{0,…,m−1}. A splay tree is a binary search tree.
Consider the BST with the following parent/child structure (left, right): root 8 with children 4 and 12, 4 with…
A leftist heap is a binary tree in which each node u stores a key and a null-path length npl[u]. A skew heap is a binary heap-ordered tree (min-heap on keys) with no npl field.
A binomial tree Bk is defined inductively: B0 is a single node; Bk consists of a root whose children are the… A red-black tree is a binary search tree in which every node is colored red or black and the following invariants…
An AVL tree is a binary search tree in which every node u stores a height ht[u], with… An order-statistic tree is a BST in which every node u stores…
A purely functional (fully persistent) queue is implemented with two persistent stacks Front and Back, each…
Design a partially persistent disjoint-set structure supporting MakeSet(x), which creates a new singleton in the…
Design a single tree-based dictionary that stores distinct comparable keys, each paired with a numeric value.
An array A[1..n] holds n distinct comparable keys.
A red-black tree stores keys from the totally ordered set {1,2,…,15} and obeys the standard invariants: the… Consider a binary search tree on the distinct keys 1,2,3,4,5,6,7 whose initial shape is the right spine…