Plain Puzzle

Plain Puzzle Without Solution Link

PuzzleFast

enWO25
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.

W

X

W

F

O

R

E

S

T

T

R

Z

Y

N

D

F

Y

L

V

K

L

F

J

V

B

M

O

E

N

P

X

C

U

X

O

L

J

I

P

M

N

L

Y

F

B

J

S

I

Y

A

I

H

G

Q

P

H

O

I

F

F

R

A

X

A

F

N

F

U

J

P

N

L

B

L

N

T

U

L

R

I

Z

X

P

E

R

L

N

I

G

Y

Y

S

B

A

B

B

E

H

T

D

O

G

E

L

U

N

C

E

N

U

T

C

O

A

I

I

R

C

C

G

A

B

E

P

K

D

S

D

A

T

N

N

X

B

J

W

B

B

D

Y

S

I

O

G

E

A

R

H

Y

E

S

U

E

T

K

M

M

D

H

S

L

E

F

E

D

P

C

G

R

W

N

R

A

P

I

D

J

M

X

E

H

L

T

I

C

H

I

E

R

U

Z

I

Q

Q

A

P

N

T

O

C

A

R

E

A

U

R

N

E

B

E

S

O

A

R

C

L

F

K

L

G

C

H

N

E

K

N

T

R

A

G

B

T

B

C

P

R

E

O

R

D

E

R

N

N

E

D

F

I

L

O

M

C

S

B

S

I

E

E

I

U

C

N

M

E

P

I

O

R

S

M

V

N

E

R

T

L

J

B

J

N

R

F

Q

M

J

D

F

D

V

O

D

R

T

Q

K

O

T

D

J

P

V

L

D

E

V

T

O

R

B

Y

F

A

C

E

E

A

O

L

H

D

A

E

I

J

D

A

Z

P

H

O

B

P

C

W

G

T

Q

O

N

L

R

Q

X

T

G

D

N

X

N

E

N

T

B

W

O

R

F

Y

U

O

T

H

R

W

S

B

A

X

A

O

O

T

S

S

H

I

E

R

A

R

C

H

I

C

A

L

W

Q

T

T

A

P

H

G

R

O

G

D

M

J

V

L

T

K

L

Q

L

G

Y

D

S

T

Y

N

H

Y

V

P

D

A

Q

G

X

U

O

E

R

E

D

H

L

E

A

F

L

P

F

S

U

B

T

R

E

E

G

Q

O

F

M

V

T

T

A

N

D

V

B

P

E

V

T

V

N

C

C

S

R

L

R

F

K

X

P

E

C

Q

F

R

X

F

J

G

P

Z

H

A

M

F

S

D

E

C

I

S

I

O

N

L

K

I

R

Z

C

M

J

I

W

F

J

Z

R

R

K

N

A

N

L

G

L

O

I

K

V

O

Y

L

O

S

G

A node with no successors.

The unique node with no predecessor.

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 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.

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.

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.

Traversal ordering where each node is processed after all nodes in both its subtrees.

The children of a node or any of their children.

A tree type which includes arithmetic operands and operators.

Trees have a ____________ structure.

Any node of a tree that has child nodes. (2 words)

A tree can be thought of as either a data structure or as an ________ ____ ____. (3 words)