Execute algorithm to convert infix into post fix expression, Data Structure & Algorithms

Assignment Help:

Q. Execute your algorithm to convert the infix expression to the post fix expression with the given infix expression as input

Q = [(A + B)/(C + D) ↑ (E / F)]+ (G + H)/ I

Ans:

The given infix expression is as follows:-

Q = [(A + B) / (C + D) ^ (E + F)] + (G + H) / I

Symb Stack Postfix Notation

[ [

( [ (

A [ ( A

+	[ ( +
B	[ ( +	AB
)	[	AB+
/	[ /
(	[ / (
C	[ / (	AB+C
+	[ / ( +
D	[ / ( +	AB+CD
)	[ /	AB+CD+
^	[ / ^
(	[ / ^ (
E	[ / ^ (	AB+CD+
/	[ / ^ ( /	AB+CD+
F	[ / ^	AB+CD+/
]	EMPTY	AB+CD+EF/^/
+	+
(	+ (
G	+ (	AB+CD+EF/^/G
+	+ ( +
H	+ ( +	AB+CD+EF/^/GH
)	+	AB+CD+EF/^/GH+
/	+ /	AB+CD+EF/^/GH+
I	+ /	AB+CD+EF/^/GH+I

POSTFIX is:- AB+CD+EF/^/GH+I/+

Related Discussions:- Execute algorithm to convert infix into post fix expression

Binary search tree, bst for 40,60,25,50,30,70,35,10,55,65,12

bst for 40,60,25,50,30,70,35,10,55,65,12

Definitions of graph, A graph G might be defined as a finite set V of verti...

A graph G might be defined as a finite set V of vertices & a set E of edges (pair of connected vertices). The notation utilized is as follows: Graph G = (V, E) Consider the g

#title., Ask quapplication of data structure estion #Minimum 100 words acce...

Ask quapplication of data structure estion #Minimum 100 words accepted#

Comparisons between linear and binary search, Comparative Study of Linear a...

Comparative Study of Linear and Binary Search Binary search is lots quicker than linear search. Some comparisons are following: NUMBER OF ARRAY ELEMENTS EXAMINED array

Memory mapping, lower triangular matrix and upper triangular matrix

lower triangular matrix and upper triangular matrix

Rl rotation - avl tree, Example: (Double left rotation while a new node is ...

Example: (Double left rotation while a new node is added into the AVL tree (RL rotation)) Figure: Double left rotation when a new node is inserted into the AVL tree A

Linear array, representation of linear array

representation of linear array

Threaded binary tree, i need the full concept of it... please can anyone pr...

i need the full concept of it... please can anyone provide

Binary search tree, write an algorithm to delete an element x from binary...

write an algorithm to delete an element x from binary search with time complex

Data Warehousing, Assume you are in the insurance business. Find two exampl...

Assume you are in the insurance business. Find two examples of Type 2 slowly changing dimensions in that business. As an analyst on the project, write the specifications for applyi

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages