Breaking News: Grepper is joining You.com. Read the official announcement!

convert infix to postfix using binary tree in python blackbox

Alireza Esmaeili answered on December 15, 2022 Popularity 1/10 Helpfulness 1/10

answer convert infix to postfix using binary tree in python blackbox

convert infix to postfix using binary tree in python blackbox

Comment

Operators = set(['+', '-', '*', '/', '(', ')', '^'])  # collection of Operators

Priority = {'+':1, '-':1, '*':2, '/':2, '^':3} # dictionary having priorities of Operators
 
 
def infixToPostfix(expression): 

    stack = [] # initialization of empty stack

    output = '' 

    

    for character in expression:

        if character not in Operators:  # if an operand append in postfix expression

            output+= character

        elif character=='(':  # else Operators push onto stack

            stack.append('(')

        elif character==')':

            while stack and stack[-1]!= '(':

                output+=stack.pop()

            stack.pop()

        else: 

            while stack and stack[-1]!='(' and Priority[character]<=Priority[stack[-1]]:

                output+=stack.pop()

            stack.append(character)

    while stack:

        output+=stack.pop()

    return output


expression = input('Enter infix expression ')

print('infix notation: ',expression)

print('postfix notation: ',infixToPostfix(expression))

Popularity 1/10 Helpfulness 1/10 Language python

Source: favtutor.com

Tags: binary-tree postfix python using

Link to this answer
Share Copy Link

Contributed on Dec 15 2022

Alireza Esmaeili

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

convert infix to postfix using binary tree in python blackbox

Contents

More Related Answers

convert infix to postfix using binary tree in python blackbox

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.