Question

In the following code I give, everytime it will output ")".

Input :

((A+B)*((C-D)/(E^F)))

Expected output :

((A+B)*((C-D)/(E^F)))
A+B*C-D/E^F

my output :

)

My code :

class Et:
  def __init__(self , value):
        self.value = value
        self.left = None
        self.right = None
  def isOperator(c):
    if (c == '+' or c == '-' or c == '*' or c == '/' or c == '^' ):
        return True
    else:
        return False
  def inorder(t):
    if t is not None:
        inorder(t.left)
        print (t.value)
        inorder(t.right)
  def constructTree(postfix):
    stack = []
    for char in postfix :
        if not isOperator(char):
            t = Et(char)
            stack.append(t)
        else:
            t = Et(char)
            t1 = stack.pop()
            t2 = stack.pop()
            t.right = t1
            t.left = t2
            stack.append(t)
    t = stack.pop()
    return t
postfix = "((A+B)*((C-D)/(E^F)))"
r = constructTree(postfix)
inorder(r)

This is the first of three assignments where you will develop a program that symbolically differentiates and arithmetic expression. You do not need to know how differentiation works to write any of the programs. You will not be doing any computations. You will be given a set of rules to apply.

Input:
For this first part you will be given a set of strings that represents a fully parenthesized infix expression that eventually (next assignment) be differentiated. The expression will be composed of single digit integers ("A"-"E"), the variable "X", parenthesis "(" and ")', and the binary operators +, -, *, /, and ^ (exponentiation). No spaces.

Process:
Generate a binary parse tree from the given input.

Output:
(1) Echo print the input string.
(2) Print out the parse tree using an in-order traversal.

Answer 1

So Here i have change the whole construct tree function code. Your code works when the input expression is in postfix format. But our given input is not in that format so i have used another login in the following code. The code works fine for the given example. I have tested it for some other examples also. It is working fine till the expression is fully parenthesized. But if you find any problems mention in the comments section. I have used python3.

class Et:
def __init__(self , value):
self.value = value
self.left = None
self.right = None
  
def inorder(t):
if t is not None:
inorder(t.left)
print(t.value, end = "")
inorder(t.right)
  
def constructTree(postfix):
stack = []
for char in postfix :
if char == ")":
t1 = stack.pop()
t2 = stack.pop()
t3 = stack.pop()
t4 = stack.pop()
t2.right = t1
t2.left = t3
stack.append(t2)
else:
t = Et(char)
stack.append(t)
t = stack.pop()
return t
postfix = "((A+B)*((C-D)/(E^F)))"
print(postfix)
r = constructTree(postfix)
inorder(r)