Lists
Stacks
Queues
Trees
Recursion
100
It is the first node in a linked list.
What is the head of the list?
100
These are the two fundamental operations used to define a stack.
What are push and pop?
100
These are the two basic operations that define a queue.
What are enqueue and dequeue?
100
Each tree has a _ and _ of these.
What are left and right child?
100
The adjective to describe a non-recursive algorithm that can be coded using a loop.
What is iterative?
200
It is a pointer to the object referred to when calling a member function.
What is this?
200
This refers to the order in which nodes are added to and removed from the stack.
What is FILO?
200
This refers to the order in which nodes are added to and removed from the queue.
What is FIFO?
200
A Tree has-a _.
What is TreeNode?
200
An example would be int main() { main(); }
What is infinite recursion?
300
0x0
What is NULL?
300
A special method used to view, but not destroy, a key of the top node.
What is peek?
300
The operation performed by q.enqueue(q.dequeue()).
What is left rotation?
300
A tree is a _ data structure.
What is recursive?
300
A type of recursion where operations are done after the recursive call.
What is non-tail recursion?
400
We use a _ when the left-hand side of a method call is an object, and a _ if i tis a pointer.
What are dot and arrow?
400
The special stack associated with any program.
What is a function stack?
400
An integer member of Queue used to tell when the queue ends.
What is size?
400
The three types of traversal algorithms for a tree.
What are pre-order, in-order, and post-order?
400
Because it requires a base and recursive case, recursion is similar to _.
What is scientific induction?
500
It is created by next = next->next.
What is a cycle?
500
The code while(top) pop(); serves as the _ for a stack.
What is the stack destructor?
500
To place an element at the front of a queue, we enqueue it and then _.
What is right-rotate?
500
The equation relating the height of the tree and the maximum capacity.
What is c = 2^h-1?
500
A type of recursion where A calls B and B calls A.
What is indirect recursion?
M
e
n
u