# For the following binary tree, inorder traversal yields the expression:

This question was previously asked in
KVS PGT CS 2017 official paper
View all KVS Papers >
1. a + bd* - ef /
2.  a + b*d - e/f
3. abdef* / + -
4. - + * / abdef

Option 2 :  a + b*d - e/f
Free
ST 1: General Knowledge
6174
20 Questions 20 Marks 20 Mins

## Detailed Solution

Concept:

In the in-order traversal method, the left subtree is visited first, then the root and then the right subtree. Every node is a subtree in itself.

Explanation:

Given a binary tree :

For this, we first visit the left - subtree of root -.

1) It will first print a. Then root, +  (a + )

2) Then it will go to right subtree, in this again left subtree of root *. It prints b , then * , then d  (a + b * d)

3) Then it print "-".  (a + b * d -)

4) Then move to right subtree. First print e, then /, then f .(e/f)

5) Final output will be :  a + b * d -  e/f
The passage contains a multiple-choice question about the inorder traversal of a binary tree, and the correct answer is provided.
single_question_with_answer
Given a text passage, determine:
    1. If it contains a mathematical question (including word problems or calculations)
    2. If an answer to that mathematical question is provided in the text

First, describe the content structure you found in 1-2 sentences.

Then provide your analysis in the following format:
TYPE: <one of the following values>
- NO_QUESTION
- SINGLE_QUESTION
- SINGLE_QUESTION_WITH_ANSWER
- MULTIPLE_QUESTIONS
- MULTIPLE_QUESTIONS_WITH_ANSWERS
system
# For the following binary tree, inorder traversal yields the expression:

This question was previously asked in
KVS PGT CS 2017 official paper
View all KVS Papers >
1. a + bd* - ef /
2.  a + b*d - e/f
3. abdef* / + -
4. - + * / abdef

Option 2 :  a + b*d - e/f
Free
ST 1: General Knowledge
6174
20 Questions 20 Marks 20 Mins

## Detailed Solution

Concept:

In the in-order traversal method, the left subtree is visited first, then the root and then the right subtree. Every node is a subtree in itself.

Explanation:

Given a binary tree :

For this, we first visit the left - subtree of root -.

1) It will first print a. Then root, +  (a + )

2) Then it will go to right subtree, in this again left subtree of root *. It prints b , then * , then d  (a + b * d)

3) Then it print "-".  (a + b * d -)

4) Then move to right subtree. First print e, then /, then f .(e/f)

5) Final output will be :  a + b * d -  e/f
user
The passage contains a multiple-choice question about the inorder traversal of a binary tree, and the correct answer is provided.

TYPE: SINGLE_QUESTION_WITH_ANSWER