1:00
Click the first and last characters of the items you find.
en
WO
27
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.
Traverse : To systematically visit every node in a tree.
Full : A binary tree in which internal nodes completely fill every level.
F | V | B | P | B | I | N | A | R | Y | H | N | L | T | P | O | S | T | O | R | D | E | R | Y | F |
O | G | D | H | H | G | L | Q | A | B | S | T | R | A | C | T | D | A | T | A | T | Y | P | E | U |
R | C | A | I | N | T | E | R | N | A | L | N | O | D | E | O | F | L | G | Y | B | J | D | L | M |
E | F | H | I | P | Z | O | C | A | V | V | Y | M | E | R | H | L | B | K | V | Q | Z | A | F | S |
S | B | I | T | D | X | V | R | Q | F | U | W | E | E | Z | U | J | Z | T | K | K | D | J | C | X |
T | T | B | J | M | L | Y | Z | W | T | K | M | P | N | F | V | R | D | E | P | T | H | Q | Z | Q |
K | M | C | M | F | L | E | S | L | D | L | O | N | U | M | A | Z | Q | R | O | O | T | P | L | W |
D | W | H | H | T | E | G | V | U | K | R | M | K | X | L | J | R | O | H | C | P | C | S | U | P |
K | S | S | K | J | N | K | D | E | P | W | X | S | D | P | J | S | J | H | E | H | O | L | X | E |
O | F | E | N | I | G | X | E | T | L | L | W | U | R | D | C | E | S | K | L | I | I | D | O | V |
S | I | Z | L | U | D | Y | S | V | P | V | Y | B | M | G | J | O | F | I | P | Q | G | L | S | T |
T | C | B | K | O | K | T | C | T | T | A | X | T | R | A | N | C | E | S | T | O | R | H | D | H |
R | I | R | C | L | K | A | E | H | Y | Q | O | R | L | U | G | I | A | Y | S | Y | Q | T | T | C |
S | W | W | C | S | V | F | N | U | R | Q | O | E | D | K | J | C | A | S | Q | Y | J | T | Q | I |
S | O | Y | K | D | I | G | D | K | F | C | I | E | N | E | G | D | P | Y | M | X | Z | A | Z | F |
R | T | I | T | R | Y | B | A | P | W | N | G | V | T | T | C | O | O | N | V | Y | F | V | W | M |
I | N | O | R | D | E | R | N | P | R | E | O | R | D | E | R | I | C | R | F | R | E | V | U | F |
X | I | Z | F | W | G | O | T | Z | D | I | R | E | C | T | E | D | S | N | D | S | B | H | J | W |
Z | F | U | T | E | R | M | I | N | A | L | Q | P | R | O | O | V | Q | I | R | E | X | Y | O | R |
A | S | Y | U | B | I | G | U | G | E | L | M | R | J | N | L | S | A | E | O | T | R | Z | N | Q |
B | M | E | X | P | R | E | S | S | I | O | N | W | K | Y | L | K | V | A | L | N | G | E | A | R |
H | I | E | R | A | R | C | H | I | C | A | L | G | O | V | Z | A | E | D | V | B | X | Z | D | Q |
J | S | Z | M | S | Y | U | O | C | U | I | W | N | I | T | R | V | A | U | N | E | P | U | J | N |
N | H | G | N | W | T | I | D | L | L | E | A | F | T | T | U | E | U | K | Z | N | E | B | V | J |
I | P | A | R | E | N | T | V | Z | C | B | D | X | T | X | M | N | C | R | F | S | D | L | Z | Z |
- A tree can be thought of as either a data structure or as an ________ ____ ____. (3 words)
- Trees have a ____________ structure.
- Any node of a tree that has child nodes. (2 words)
- The children of a node or any of their children.
- A tree type which includes arithmetic operands and operators.
- Traversal ordering where each node is processed after all nodes in both its subtrees.
- The predecessor of a node or any of its predecessors.
- A type of tree where the path taken is determined by a Boolean expression.
- Trees have ________ edges.
- Traversal ordering where each node is processed before any nodes in its subtrees.
- Any pair of nodes that have the same parent.
- Another term for a leaf node is a ________ node.
- To systematically visit every node in a tree.
- Traversal ordering where each node is processed after all nodes in its left subtree but before any nodes in its right subtree.
| - 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)
- A node together with its descendants.
- A tree with a maximum of two children, which are defined by their position, left or right.
- A set or list of trees.
- The length of the longest downward path to a leaf from a node is the node’s _____.
- The predecessor of a node.
- A subtree corresponding to any other node than the root is called a ______ subtree.
- Any successor of a node.
- The length of the path from a node to the root is the node’s _____.
- All of the nodes that have the same depth are on the same _____.
- A binary tree in which internal nodes completely fill every level.
- A node with no successors.
- The unique node with no predecessor.
|
© 2013
PuzzleFast.com, Noncommercial Use Only
F | V | B | P | B | I | N | A | R | Y | H | N | L | T | P | O | S | T | O | R | D | E | R | Y | F |
O | G | D | H | H | G | L | Q | A | B | S | T | R | A | C | T | D | A | T | A | T | Y | P | E | U |
R | C | A | I | N | T | E | R | N | A | L | N | O | D | E | O | F | L | G | Y | B | J | D | L | M |
E | F | H | I | P | Z | O | C | A | V | V | Y | M | E | R | H | L | B | K | V | Q | Z | A | F | S |
S | B | I | T | D | X | V | R | Q | F | U | W | E | E | Z | U | J | Z | T | K | K | D | J | C | X |
T | T | B | J | M | L | Y | Z | W | T | K | M | P | N | F | V | R | D | E | P | T | H | Q | Z | Q |
K | M | C | M | F | L | E | S | L | D | L | O | N | U | M | A | Z | Q | R | O | O | T | P | L | W |
D | W | H | H | T | E | G | V | U | K | R | M | K | X | L | J | R | O | H | C | P | C | S | U | P |
K | S | S | K | J | N | K | D | E | P | W | X | S | D | P | J | S | J | H | E | H | O | L | X | E |
O | F | E | N | I | G | X | E | T | L | L | W | U | R | D | C | E | S | K | L | I | I | D | O | V |
S | I | Z | L | U | D | Y | S | V | P | V | Y | B | M | G | J | O | F | I | P | Q | G | L | S | T |
T | C | B | K | O | K | T | C | T | T | A | X | T | R | A | N | C | E | S | T | O | R | H | D | H |
R | I | R | C | L | K | A | E | H | Y | Q | O | R | L | U | G | I | A | Y | S | Y | Q | T | T | C |
S | W | W | C | S | V | F | N | U | R | Q | O | E | D | K | J | C | A | S | Q | Y | J | T | Q | I |
S | O | Y | K | D | I | G | D | K | F | C | I | E | N | E | G | D | P | Y | M | X | Z | A | Z | F |
R | T | I | T | R | Y | B | A | P | W | N | G | V | T | T | C | O | O | N | V | Y | F | V | W | M |
I | N | O | R | D | E | R | N | P | R | E | O | R | D | E | R | I | C | R | F | R | E | V | U | F |
X | I | Z | F | W | G | O | T | Z | D | I | R | E | C | T | E | D | S | N | D | S | B | H | J | W |
Z | F | U | T | E | R | M | I | N | A | L | Q | P | R | O | O | V | Q | I | R | E | X | Y | O | R |
A | S | Y | U | B | I | G | U | G | E | L | M | R | J | N | L | S | A | E | O | T | R | Z | N | Q |
B | M | E | X | P | R | E | S | S | I | O | N | W | K | Y | L | K | V | A | L | N | G | E | A | R |
H | I | E | R | A | R | C | H | I | C | A | L | G | O | V | Z | A | E | D | V | B | X | Z | D | Q |
J | S | Z | M | S | Y | U | O | C | U | I | W | N | I | T | R | V | A | U | N | E | P | U | J | N |
N | H | G | N | W | T | I | D | L | L | E | A | F | T | T | U | E | U | K | Z | N | E | B | V | J |
I | P | A | R | E | N | T | V | Z | C | B | D | X | T | X | M | N | C | R | F | S | D | L | Z | Z |
- ABSTRACTDATATYPE
- HIERARCHICAL
- INTERNALNODE
- DESCENDANT
- EXPRESSION
- POSTORDER
- ANCESTOR
- DECISION
- DIRECTED
- PREORDER
- SIBLINGS
- TERMINAL
- TRAVERSE
- INORDER
| - ORDERED
- SUBTREE
- BINARY
- FOREST
- HEIGHT
- PARENT
- PROPER
- CHILD
- DEPTH
- LEVEL
- FULL
- LEAF
- ROOT
|
© 2013
PuzzleFast.com, Noncommercial Use Only