expression-evaluation

School Programming

C++ Programs

Building Expression tree from Prefix Expression

Last Updated: 22 December 2023

Given a character array a[] represents a prefix expression. The task is to build an Expression Tree for the expression and then print the in ...read more

Tree

Data Structures

C Programs

Arithmetic Expression Evaluation

Last Updated: 19 June 2023

The stack organization is very effective in evaluating arithmetic expressions. Expressions are usually represented in what is known as Infix...read more

Data Structures-Stack

Parentheses-Problems

Infix to Prefix conversion using two stacks

Similar Topics

DSA

21.9k+ articles

Mathematical

7.7k+ articles

Arrays

6.3k+ articles

Strings

3.2k+ articles

Greedy

2k+ articles

Amazon

1.7k+ articles

School Programming

1.3k+ articles

Recursion

1k+ articles

Stack

410+ articles

Backtracking

220+ articles

Last Updated: 19 August 2022

Infix: An expression is called the Infix expression if the operator appears in between the operands in the expression. Simply of the form (o ...read more

Check for balanced parenthesis without using stack

Last Updated: 16 March 2023

Given an expression string exp, write a program to examine whether the pairs and the orders of “{“, ”}”, ”(“, ”)”, ”[“, ...read more

Amazon

Recursion

Solve the Linear Equation of Single Variable

Last Updated: 01 August 2022

Given a linear equation, task is to find the value of variable used. The equation contains only '+', '-' operation, the variable and its coe ...read more

Prefix to Infix Conversion

Last Updated: 03 August 2022

Infix : An expression is called the Infix expression if the operator appears in between the operands in the expression. Simply of the form ( ...read more

Prefix to Postfix Conversion

Last Updated: 23 January 2024

Given a Prefix expression, convert it into a Postfix expression.Conversion of Prefix expression directly to Postfix without going through th ...read more

Postfix to Prefix Conversion

Last Updated: 18 April 2023

Postfix: An expression is called the postfix expression if the operator appears in the expression after the operands. Simply of the form (op ...read more

Postfix to Infix

Last Updated: 11 July 2023

Infix expression: The expression of the form a op b. When an operator is in-between every pair of operands.Postfix expression: The expressio ...read more

Expression contains redundant bracket or not

Last Updated: 28 June 2023

Given a string of balanced expressions, find if it contains a redundant parenthesis or not. A set of parenthesis is redundant if the same su ...read more

Evaluation of Prefix Expressions

Last Updated: 12 January 2023

Prefix and Postfix expressions can be evaluated faster than an infix expression. This is because we don't need to process any brackets or fo ...read more

Convert Infix To Prefix Notation

Last Updated: 27 March 2023

Given an infix expression, the task is to convert it to a prefix expression.Infix Expression: The expression of type a 'operator' b (a+b, wh...read more

Evaluation of Postfix Expression

Last Updated: 27 March 2023

Given a postfix expression, the task is to evaluate the postfix expression.Postfix expression: The expression of the form "a b operator" (ab...read more

Amazon

Convert Infix expression to Postfix expression

Last Updated: 26 December 2023

Write a program to convert an Infix expression to Postfix form.Infix expression: The expression of the form "a operator b" (a + b) i.e., whe...read more