- PrQUE as linked cell list... worst case time for "enq"?
- PrQUE as linked cell list... worst case time for "front"?
- PrQUE as Balanced BST ... worst case time for "enq"?
- PrQUE as Balanced BST ... worst case time for "front"?
- Is this figure a valid min bin heap?
- Is this figure a valid min bin heap?
- Is this figure a valid min bin heap?
- Heap or No Heap?
- Heap or No Heap?

- How much runtime memory needed for this code?
- How much runtime memory needed for this code?
- How much runtime memory needed for this code?
- How much runtime memory needed for this code?
- Meaning of "garbage collection" in Java

- worst case complexity of insert on BST
- average case complexity of insert
- max # nodes in BST with height 15
- min # nodes in BST with height 15
- T/F: for any set of keys, there is one BST
- Traversal for keys in alpha order
- T/F: BST for sorting is better than Bubble Sort
- Worst case time complexity of post-order traversal
- Best case time complexity of post-order traversal
- How many recursive calls made in recursive "height" computation?

- Node height in a tree
- Node depth in a tree
- Tree height
- In-Order traversal
- Breadth-First traversal
- Adding to a Binary Search Tree

- Worst case time complexity of Bubble Sort
- Worst case complexity of Sorting into a List
- Which is worse that O(N^2)?
- Complexity of Code sample
- Another Big Oh for O(N^3) algorithm?

- LIST with links, Big Oh of get?
- LIST with array, Big Oh of get?
- LIST with array, Big Oh of remove?
- LIST with links, Big Oh of add?
- LIST with links, best case Big Oh of add?
- Meaning of axiom remove(add(DS,elt)) = DS
- Meaning of axiom remove(add(DS,elt)) = ite(DS==new,new,add(remove(DS),elt)
- Meaning of axiom remove(add(DS,elt)) = add(DS,elt)
- STACK with array, Big Oh of push?
- STACK with links, Big Oh of push?
- QUEUE with array, Big Oh of deque?