Data Structure Test Set 3

Q11➡ |
The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is:

i ➥ n/2

ii ➥ (n-1)/3

iii ➥ (n-1)/2

iv ➥ (2n+1)/3

Q12➡ |
Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in-order traversal sequence of the resultant tree?

i ➥ 7 5 1 0 3 2 4 6 8 9

ii ➥ 0 2 4 3 1 6 5 9 8 7

iii ➥ 0 1 2 3 4 5 6 7 8 9

iv ➥ 9 8 6 4 2 3 0 1 5 7

Q13➡ |
Level order traversal of a rooted tree can be done by starting from the root and performing

i ➥ preorder traversal

ii ➥ inorder traversal

iii ➥ depth first search

iv ➥ breadth first search

Q14➡ |
The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?

i ➥ 2

ii ➥ 3

iii ➥ 4

iv ➥ 6