Given the following expression tree, identify the correct arithmetic expression:

This question was previously asked in

KVS PGT CS 2018 official paper

- (A + B)*/A-C
- A + (B*C)/(A-C)
- A + B*C/A-C
- (A + B*C)/(A-C)

Option 4 : (A + B*C)/(A-C)

Free

ST 1: General Awareness

6919

15 Questions
15 Marks
15 Mins

**Concept:**

**Algorithm:**

Step 1: Put operands into stack when we visiting operator last time go to step 2

Step 2: Calculate pop1 operator pop2 and again push into stack and Repeat Step 1

Step 3: Repeat Step 1 and Step 2 until Root node is visited last time

**Explanation:**

So option 4 is the correct answer.

India’s **#1 Learning** Platform

Start Complete Exam Preparation

Daily Live MasterClasses

Practice Question Bank

Mock Tests & Quizzes

Trusted by 2,16,57,140+ Students

187 Total Tests 2 Free Tests

Start Free Test
40 Total Tests 3 Free Tests

Start Free Test
Testbook Edu Solutions Pvt. Ltd.

1st & 2nd Floor, Zion Building,

Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

[email protected]
Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

Toll Free:1800 833 0800

Office Hours: 10 AM to 7 PM (all 7 days)