MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 5 Mcqs, each offering curated multiple-choice questions to sharpen your Postorder Traversal Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
For a binary tree the first node visited in in-order and post-order traversal is same. |
| A. | True |
| B. | False |
| Answer» C. | |
| 2. |
The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree? |
| A. | L N M O Q P T |
| B. | N M O P O L T |
| C. | L M N O P Q T |
| D. | O P L M N Q T |
| Answer» B. N M O P O L T | |
| 3. |
Which of the following pair s traversals on a binary tree can build the tree uniquely? |
| A. | post-order and pre-order |
| B. | post-order and in-order |
| C. | post-order and level order |
| D. | level order and preorder |
| Answer» C. post-order and level order | |
| 4. |
A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75? |
| A. | 7, 8, 26, 13, 75, 40, 70, 35 |
| B. | 26, 13, 7, 8, 70, 75, 40, 35 |
| C. | 7, 8, 13, 26, 35, 40, 70, 75 |
| D. | 8, 7, 26, 13, 40, 75, 70, 35 |
| Answer» E. | |
| 5. |
What is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, M, L when traversed in post-order. |
| A. | 15 |
| B. | 3 |
| C. | 5 |
| D. | 8 |
| Answer» D. 8 | |