|
ancestors
|
A |
the nodes linked below a node in a tree
|
|
balance
|
B |
a data structure in which the elements or nodes do not appear in a line (a
tree)
|
|
binary tree
|
C |
two nodes with the same parent
|
|
branch nodes
|
D |
to add an item to a queue
|
|
children
|
E |
the nodes that link a node to the root
|
|
dequeue
|
F |
nodes that have branches
|
|
descendants
|
G |
the arrangement of nodes in a tree
|
|
enqueue
|
H |
the structure that contains the data in a tree
|
|
first-in first-out (FIFO)
|
I |
when the size of a stack is too small to hold all the items being pushed
on the stack
|
|
key
|
J |
to remove an item from a stack
|
|
last-in first-out (LIFO)
|
K |
nodes that do not have branches
|
|
leaf nodes
|
L |
a data structure in which the last data in is the first data out
|
|
levels
|
M |
a tree structure that allows only two branches from each node
|
|
linear data structure
|
N |
a way of identifying the depth of a tree
|
|
node
|
O |
the node above a given node to which the given node is linked
|
|
nonlinear data structure
|
P |
the node at the top of a tree from which all nodes in the tree descend
|
|
parent
|
Q |
a data structure that allows items to be added and deleted from only one
end
|
|
pop
|
R |
a data structure in which the elements or nodes are arranged in a line
|
|
push
|
S |
a data structure that allows additions at only one end (called the rear)
and deletions at the opposite end (called the front)
|
|
queue
|
T |
the value by which the data in a tree is sorted or searched or data in a
data structure is searched
|
|
root
|
U |
to remove an item from a queue
|
|
siblings
|
V |
to add an item to a stack
|
|
stack
|
W |
a data structure in which the first data put into the structure is the
first data to be taken out
|
|
stack overflow
|
X |
the one or two nodes below a given node
|