1.4.2 Data Structures - Graphs and Trees

How many parent nodes are there?

• 4

• 5

• 6

• 7

How many leaf nodes are there?

• 4

• 5

• 6

• 7

Which of the following is TRUE about this tree?

• This tree is a binary tree only

• This tree is a binary search tree

• This is a non-binary tree

What traversal gives out the letters in alphabetical order?

• In-order traversal

• Pre-order traversal

• Post-order traversal

What is the order of nodes traversed in a pre-order traversal of this tree?

• A, B, C, D, E, F, G, H, I, J

• E, B, A, C, D, G, F, I, H, J

• A, D, C, B, F, H, J, I, G, E

• B, A, C, D, G, F, I, H, J, E

What is the order of nodes traversed in a post-order traversal of this tree?

• A, B, C, D, E, F, G, H, I, J

• E, B, A, C, D, G, F, I, H, J

• A, D, C, B, F, H, J, I, G, E

• B, A, C, D, G, F, I, H, J, E

Traversing this tree, the arithmetic expression obtained is a×b + c÷d.

What type of traversal was performed?

• In-order

• Pre-order

• Post-order

Traversing this tree, the arithmetic expression obtained is + ×ab ÷ cd. What type of traversal was performed?

• In-order

• Pre-order

• Post-order

Which of the following statements is true?

• A graph is also a tree.

• A tree can have both directed and undirected edges.

• A tree can have a connection between two child nodes.

• A tree is a special case of a connected graph with only undirected edges and no cycles.

Which of the following is TRUE about a binary search tree?

(Select All That Apply)

• Each parent node has a maximum of two child nodes.

• The value in a left child node is less than the value in the parent node.

• The value in the right child node is greater than the value in the parent node.