MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 3 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Construct a binary tree using inorder and level order traversal given below.
|
| A. | nLevel Order Traversal: 1, 4, 5, 9, 8, 2, 3 |
| B. | <a href="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q13a.png"><img alt="Binary tree with traversal inorder Traversal: 3, 4, 2, 1, 5, 8, 9 - option a" class="alignnone size-full wp-image-250188" height="199" sizes="(max-width: 247px) 100vw, 247px" src="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q13a.png" srcset="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q13a.png 247w, https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q13a-100x80.png 100w" width="247"/></a> |
| C. | <a href="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q13b.png"><img alt="Binary tree with traversal inorder Traversal: 3, 4, 2, 1, 5, 8, 9 - option b" class="alignnone size-full wp-image-250189" height="202" src="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q13b.png" width="244"/></a> |
| D. | <a href="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q13c.png"><img alt="Binary tree with traversal inorder Traversal: 3, 4, 2, 1, 5, 8, 9 - option c" class="alignnone size-full wp-image-250190" height="209" src="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q13c.png" width="246"/></a> |
| E. | <a href="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q13d.png"><img alt="Binary tree with traversal inorder Traversal: 3, 4, 2, 1, 5, 8, 9 - option d" class="alignnone size-full wp-image-250191" height="203" src="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q13d.png" width="244"/></a> |
| Answer» B. <a href="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q13a.png"><img alt="Binary tree with traversal inorder Traversal: 3, 4, 2, 1, 5, 8, 9 - option a" class="alignnone size-full wp-image-250188" height="199" sizes="(max-width: 247px) 100vw, 247px" src="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q13a.png" srcset="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q13a.png 247w, https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q13a-100x80.png 100w" width="247"/></a> | |
| 2. |
Construct a binary search tree by using postorder sequence given below.
|
| A. | <a href="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q12a.png"><img alt="Binary search tree by using postorder sequence postorder: 2, 4, 3, 7, 9, 8, 5 - option a" class="alignnone size-full wp-image-250183" height="213" src="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q12a.png" width="231"/></a> |
| B. | <a href="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q12b.png"><img alt="Binary search tree by using postorder sequence postorder: 2, 4, 3, 7, 9, 8, 5 - option b" class="alignnone size-full wp-image-250185" height="209" src="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q12b.png" width="247"/></a> |
| C. | <a href="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q12c.png"><img alt="Binary search tree by using postorder sequence postorder: 2, 4, 3, 7, 9, 8, 5 - option c" class="alignnone size-full wp-image-250186" height="215" src="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q12c.png" width="245"/></a> |
| D. | <a href="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q12d.png"><img alt="Binary search tree by using postorder sequence postorder: 2, 4, 3, 7, 9, 8, 5 - option d" class="alignnone size-full wp-image-250187" height="203" src="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q12d.png" width="244"/></a> |
| Answer» C. <a href="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q12c.png"><img alt="Binary search tree by using postorder sequence postorder: 2, 4, 3, 7, 9, 8, 5 - option c" class="alignnone size-full wp-image-250186" height="215" src="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q12c.png" width="245"/></a> | |
| 3. |
Construct a binary tree by using postorder and inorder sequences given below.
|
| A. | nPostorder: N, P, Q, O, M |
| B. | <a href="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q11a.png"><img alt="A binary tree by using postorder & inorder sequences - option a" class="alignnone size-full wp-image-250179" height="202" src="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q11a.png" width="188"/></a> |
| C. | <a href="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q11b.png"><img alt="A binary tree by using postorder & inorder sequences - option b" class="alignnone size-full wp-image-250180" height="212" src="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q11b.png" width="203"/></a> |
| D. | <a href="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q11c.png"><img alt="A binary tree by using postorder & inorder sequences - option c" class="alignnone size-full wp-image-250181" height="207" src="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q11c.png" width="202"/></a> |
| E. | <a href="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q11d.png"><img alt="A binary tree by using postorder & inorder sequences - option d" class="alignnone size-full wp-image-250182" height="211" src="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q11d.png" width="195"/></a> |
| Answer» E. <a href="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q11d.png"><img alt="A binary tree by using postorder & inorder sequences - option d" class="alignnone size-full wp-image-250182" height="211" src="https://www.sanfoundry.com/wp-content/uploads/2017/08/data-structure-questions-answers-binary-tree-properties-q11d.png" width="195"/></a> | |