enSC25
parent : The predecessor of a node.
child : Any successor of a node.
siblings : Any pair of nodes that have the same parent.
Ancestor : The predecessor of a node or any of its predecessors
Descendant : The children of a node or any of their children
subtree : A node together with its descendants.
root : The unique node with no predecessor.
Leaf : A node with no successors.
Binary : A tree with a maximum of two children, which are defined by their position, left or right.
Height : The length of the longest downward path to a leaf from a node is the node’s _____.
Preorder : Traversal ordering where each node is processed before any nodes in its subtrees
Inorder : Traversal ordering where each node is processed after all nodes in its left subtree but before any nodes in its right subtree.
postorder : Traversal ordering where each node is processed after all nodes in both its subtrees.
Ordered : A tree in which nodes are ordered so that all keys in a node's left subtree are less than the key of the object at the node, and all keys in a node's right subtree are greater than the key of the object at the node. (Also known as a search tree)
Depth : The length of the path from a node to the root is the node’s _____.
Terminal : Another term for a leaf node is a ________ node.
Internal node : Any node of a tree that has child nodes. (2 words)
proper : A subtree corresponding to any other node than the root is called a ______ subtree.
Abstract data type : A tree can be thought of as either a data structure or as an : (3 words)
Hierarchical : Trees have a ____________ structure.
Forest : A set or list of trees.
Decision : A type of tree where the path taken is determined by a Boolean expression.
Level : All of the nodes that have the same depth are on the same _____.
Directed : Trees have ________ edges.
Expression : A tree type which includes arithmetic operands and operators.
ODDREER
A tree in which nodes are ordered so that all keys in a node's left subtree are less than the key of the object at the node, and all keys in a node's right subtree are greater than the key of the object at the node. (Also known as a search tree)
ONIDERR
Traversal ordering where each node is processed after all nodes in its left subtree but before any nodes in its right subtree.
NYRBAI
A tree with a maximum of two children, which are defined by their position, left or right.
RTSOOEDPR
Traversal ordering where each node is processed after all nodes in both its subtrees.
OPERPR
A subtree corresponding to any other node than the root is called a ______ subtree.
EGTHIH
The length of the longest downward path to a leaf from a node is the node’s _____.
ERORDRPE
Traversal ordering where each node is processed before any nodes in its subtrees
SIINDECO
A type of tree where the path taken is determined by a Boolean expression.
PAASEATDABCYTRTT
A tree can be thought of as either a data structure or as an : (3 words)
HPDTE
The length of the path from a node to the root is the node’s _____.
ELLEV
All of the nodes that have the same depth are on the same _____.
ORPESNESIX
A tree type which includes arithmetic operands and operators.
CSTNERAO
The predecessor of a node or any of its predecessors
LONRTDNEIAEN
Any node of a tree that has child nodes. (2 words)
A tree in which nodes are ordered so that all keys in a node's left subtree are less than the key of the object at the node, and all keys in a node's right subtree are greater than the key of the object at the node. (Also known as a search tree)
O
R
D
E
R
E
D
ONIDERR
Traversal ordering where each node is processed after all nodes in its left subtree but before any nodes in its right subtree.
I
N
O
R
D
E
R
NYRBAI
A tree with a maximum of two children, which are defined by their position, left or right.
B
I
N
A
R
Y
RTSOOEDPR
Traversal ordering where each node is processed after all nodes in both its subtrees.
P
O
S
T
O
R
D
E
R
OPERPR
A subtree corresponding to any other node than the root is called a ______ subtree.
P
R
O
P
E
R
EGTHIH
The length of the longest downward path to a leaf from a node is the node’s _____.
H
E
I
G
H
T
ERORDRPE
Traversal ordering where each node is processed before any nodes in its subtrees
P
R
E
O
R
D
E
R
SIINDECO
A type of tree where the path taken is determined by a Boolean expression.
D
E
C
I
S
I
O
N
PAASEATDABCYTRTT
A tree can be thought of as either a data structure or as an : (3 words)
A
B
S
T
R
A
C
T
D
A
T
A
T
Y
P
E
HPDTE
The length of the path from a node to the root is the node’s _____.
D
E
P
T
H
ELLEV
All of the nodes that have the same depth are on the same _____.
L
E
V
E
L
ORPESNESIX
A tree type which includes arithmetic operands and operators.
E
X
P
R
E
S
S
I
O
N
CSTNERAO
The predecessor of a node or any of its predecessors
A
N
C
E
S
T
O
R
LONRTDNEIAEN
Any node of a tree that has child nodes. (2 words)