Term
|
Definition
a block of memory that contains elements of the same type that's accessed by an index |
|
|
Term
|
Definition
a simple case that can be solved easily |
|
|
Term
|
Definition
a tree where the left subtree contains nodes that are smaller than the root, and the right subtree contains nodes that are greater than the root |
|
|
Term
|
Definition
a node that a parent node points to |
|
|
Term
|
Definition
in object-oriented programming, a description of similar objects |
|
|
Term
|
Definition
the number of links between the root of a tree and the leaves |
|
|
Term
|
Definition
all nodes below a given node in a tree |
|
|
Term
|
Definition
|
|
Term
|
Definition
(Are you f*cking kidding me? Is this CS or Red Lobster?) a process in which every customer will eventually be served |
|
|
Term
|
Definition
a tree in which two pointers are used per node but can represent multiple children of a node |
|
|
Term
|
Definition
(Are we German now? O_o) a thought experiment |
|
|
Term
|
Definition
a data structure that cannot be changed |
|
|
Term
|
Definition
given two sets, the intersection is the set of elements that are in both sets |
|
|
Term
|
Definition
Last in first out, the ordering for stacks |
|
|
Term
|
Definition
a sequence of nodes where each node contains a link to the next node |
|
|
Term
|
Definition
a runtime error when an operation is attempted on a null pointer |
|
|
Term
|
Definition
in a search tree, a program that changes a state to a child state |
|
|
Term
|
Definition
in a tree, you process the children before the parent |
|
|
Term
|
Definition
a data structure that represents a sequence of items that is removed in the order they came in (like a line) |
|
|
Term
|
Definition
a condition where the data will be processed by the same program |
|
|
Term
|
Definition
|
|
Term
|
Definition
to look through a data structure until a goal is found |
|
|
Term
|
Definition
an effect of a method other than returning a value such as printing or modifying something |
|
|
Term
|
Definition
the amount of space on the runtime stack required to run a program |
|
|
Term
|
Definition
the next element in a linked list |
|
|
Term
|
Definition
given two sets, the union returns a set that contains elements that are members of either set |
|
|