CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Sporulation

The inorder a...

Question

The inorder and preorder traversal of a binary tree are dbeafcg and abdecfg respectively. The postorder traversal of the binary tree is

A

debfgca

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

B

edbfgca

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

edbgfca

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

defgbca

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A debfgca
The inorder traversal sequence is dbeafcg and the preorder traversal sequence is abdecfg.

So the tree is

In the post order traversal the sequence is debfgca.

Suggest Corrections

thumbs-up

4

Similar questions

Q. Let PRE, IN, POST, LVL denote the preorder, postorder, inorder and level order traversal respectively. Then which of the following combinations of traversals is not sufficient to uniquely construct a binary tree?

Q. If we traverse a binary search tree, in which manner that we get in ascending manner ___________.

Q. The number of binary trees with 3 nodes which when traversed in post order gives the sequence A,B,C is?

Q. Consider the following new - order strategy for traversing a binary tree:The New - order traversal of the expression tree corresponding to the reverse polish expression 3 4 * 5 - 2 ^ 6 7 * 1 + - is given by

Q. Consider the following New-order startegy for traversing a binary tree.The New-order traversal of the expression tree corresponding to the reverse polish expression

(3 4 * 5 - 2 ^ 6 7 * 1 + -)

is given by

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Asexual Reproduction

BIOLOGY

Watch in App

explore_more_icon

Explore more

Standard XII Biology

Join BYJU'S Learning Program

CrossIcon