Chapter 21 Flashcards

1
Q

binary tree

A

A tree in which each node refers to zero, one, or two dependent nodes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

root

A

The topmost node in a tree, with no parent.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

leaf

A

A bottom-most node in a tree, with no children.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

parent

A

The node that refers to a given node.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

child

A

One of the nodes referred to by a node.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

siblings

A

Nodes that share a common parent.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

level

A

The set of nodes equidistant from the root.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

binary operator

A

An operator that takes two operands.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

subexpression

A

An expression in parentheses that acts as a single operand in a larger expression.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

preorder

A

A way to traverse a tree, visiting each node before its children.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

prefix notation

A

A way of writing a mathematical expression with each operator appearing before its operands.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

postorder

A

A way to traverse a tree, visiting the children of each node before the node itself.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

inorder

A

A way to traverse a tree, visiting the left subtree, then the root, and then the right subtree.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly