Big-0
Stacks
Queues
Trees
Recursion
100
Worst case of bubblesort
O(n^2)
100
The name of the only accessible node in the stack
What is top?
100
The pointer to the back of the queue
What is tail?
100
The number of levels
What is the height?
100
The case which terminates recursion
What is the base case?
200
Average case of quicksort
O(nlogn)
200
An operation for placing a node on top of the stack
What is push?
200
The _ method adds nodes to the _ of the queue
What is enqueue, tail?
200
2^n - 1
What is the capacity?
200
The case which makes a recursive call
What is recursive case?
300
Worst case when searchinf a binary search tree
O(n)
300
Removes the node on the top and returns the key
What is pop?
300
The _ method removes a node from the _ of the queue and returns its key
What is dequeue, head?
300
When left and right subtrees have equal height, the tree is _
What is balanced?
300
When a recursive function has no base case, it becomes _ recursion
What is infinite?
400
Complexity of for(int i = 0; i
O(n^2)
400
FILO
What is first-in, last-out?
400
FIFO
What is first-in, first-out?
400
A parent of a parent node is an _, while a child of a child is a _
What is ancestor, descendant?
400
An image printed by a recursive drawing algorithm
What is a fractal?
500
Insertion into a priority queue that is implemented as a sorted linked list
O(n)
500
Returns key but does not delete node
What is peek?
500
These two operations, which shift elements left and right, cancel each other
What are lRotate and rRotate?
500
Top-to-bottom, left-to-right traversal
What is level-order?
500
A type of stack used to keep track of recursive calls
What is a function stack?
M
e
n
u