Sponsor Area

NCERT Solutions for Class 12 Help.html Computer Science With C++ Chapter 9 Linked List, Stack And Queue

Linked List, Stack And Queue Here is the CBSE Help.html Chapter 9 for Class 12 students. Summary and detailed explanation of the lesson, including the definitions of difficult words. All of the exercises and questions and answers from the lesson's back end have been completed. NCERT Solutions for Class 12 Help.html Linked List, Stack And Queue Chapter 9 NCERT Solutions for Class 12 Help.html Linked List, Stack And Queue Chapter 9 The following is a summary in Hindi and English for the academic year 2025-26. You can save these solutions to your computer or use the Class 12 Help.html.

Question 1
CBSEENCO12011527

Convert the following Infix expression to its equivalent Postfix expression, showing the stack contents for each step of conversion.
P + ( Q - R ) * S / T

Solution

Conversion of  the given Infix expression to its equivalent Postfix expression
(P+(((Q-R)*S)/T))

INFIX STACK POSTFIX
( (  
P ( P
+ (+ P
( (+( P
Q (+( PQ
- (+(- PQ
R (+(- PQR
) (+ PQR-
* (+* PQR-
S (+* PQR-S
/ (+/ PQR-S*
T (+/ PQR-S*T
)   PQR-S*T/+

Sponsor Area