Chapter 10 Trees

Data Structures and Other Objects Using C++

by Michael Main and Walter Savitch

14

/ \

2 11

/ \ / \

1 3 10 30

/ /

7 40

1. There is a tree in the box at the top of this section. How many leaves does it have?

? A. 2

? B. 4

? C. 6

? D. 8

? E. 9

2. There is a tree in the box at the top of this section. How many of the nodes have at least one sibling?

? A. 5

? B. 6

? C. 7

? D. 8

? E. 9

3. There is a tree in the box at the top of this section. What is the value stored in the parent node of the node containing 30?

? A. 10

? B. 11

? C. 14

? D. 40

? E. None of the above

4. There is a tree in the box at the top of this section. How many descendants does the root have?

? A. 0

? B. 2

? C. 4

? D. 8

5. There is a tree in the box at the top of this section. What is the depth of the tree?

? A. 2

? B. 3

? C. 4

? D. 8

? E. 9

6. There is a tree in the box at the top of this section. How many children does the root have?

? A. 2

? B. 4

? C. 6

? D. 8

? E. 9

7. Consider the binary tree in the box at the top of this section. Which statement is correct?

? A. The tree is neither complete nor full.

? B. The tree is complete but not full.

? C. The tree is full but not complete.

? D. The tree is both full and complete.

8. What is the minimum number of nodes in a full binary tree with depth 3?

? A. 3

? B. 4

? C. 8

? D. 11

? E. 15

9. What is the minimum number of nodes in a complete binary tree with depth 3?

? A. 3

? B. 4

? C. 8

? D. 11

? E. 15

10. Select the one true statement.

? A. Every binary tree is either complete or full.

? B. Every complete binary tree is also a full binary tree.

? C. Every full binary tree is also a complete binary tree.

? D. No binary tree is both complete and full.