Solving a Postfix Expression: ABCD+*/E- Tree

  • Thread starter Thread starter Bucs44
  • Start date Start date
  • Tags Tags
    Expression Tree
Click For Summary
The discussion focuses on converting the postfix expression ABCD+*/E- into a binary tree. Participants emphasize using a stack to manage operands and operators, noting that letters represent values to be stacked, while operators indicate operations on the last two stacked values. The left side of the tree is clarified as needing to wait until the operator + is encountered, which allows for identifying C and D as leaves of the + node. The conversation suggests that understanding the equivalent infix expression could aid in visualizing the tree structure. Overall, the discussion highlights the importance of sequentially parsing the expression to accurately construct the binary tree.
Bucs44
Messages
57
Reaction score
0

Homework Statement


I am having a hard time figuring out this postfix expression and turning it into a binary tree: ABCD+*/E-



The Attempt at a Solution



what's confusing me is the left side of the tree - the ABCD - I know the right side of the tree would look like this: - is the root and * / E

Any help would be greatly appreciated
 
Physics news on Phys.org
When you see a letter, think of it as an instruction to put it on a stack. When you see an operator, think of pulling the last two things off the stack and pushing the result of the operation back on the stack. So after you've parsed the ABCD, you have four things on the stack waiting for later operations.
 
What needs to be parsed? AB on the left and CD on the right?
 
Bucs44 said:
What needs to be parsed? AB on the left and CD on the right?

?? Neither. I can't start drawing a tree until I hit the +, at which point I realize C and D are leaves of the + node. Then the + node is itself a leaf of the * node, to get the other leaf I go back and see what's on the stack and there is a B etc etc.
 
(This belongs into the computer homework section.)

It might be instructive for you to work out the equivalent infix expression.
 

Thread 'Distance between a Clock's hands when the distance is increasing most rapidly'

Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?
View full post »

Similar threads

Differential equation tree height
  • · Replies 3 ·
Replies
3
Views
2K
How long has the tree been dead?
  • · Replies 5 ·
Replies
5
Views
3K
Applying the chain rule using trees?
  • · Replies 2 ·
Replies
2
Views
2K
Vector Geometry: Quadrangular Pyramid with Inner and Cross Products
  • · Replies 1 ·
Replies
1
Views
2K
Algorithm for computing the depths of all the nodes of tree
  • · Replies 1 ·
Replies
1
Views
3K
High School Probably a silly question about tree diagrams
  • · Replies 16 ·
Replies
16
Views
2K
Intuition about simplifying this expression
  • · Replies 2 ·
Replies
2
Views
1K
Array-list implementation of tree problem
  • · Replies 3 ·
Replies
3
Views
2K
Solve ##\int\frac{e^{-x}}{x^2}dx## and ##\int \frac{e^{-x}}{x}dx##
  • · Replies 7 ·
Replies
7
Views
2K
Number theory question - binary trees
  • · Replies 5 ·
Replies
5
Views
2K