Prefix notation is a notation in which operators are written before their operands. For example, the expressions given are in prefix notation / * A + B C D. Point to consider Permitted operands: A,B,C,D means any real number is permitted. Permitted operators: +,-, *, /, ^(exponentiation) Blanks are permitted in the expression Parenthesis are … Read more

In Postfix expression operators are written after their operands. For example, the expressions given are in postfix notation A B C + * D /. Point to consider Prefix and Postfix expressions can be evaluated faster in comparison to an infix expression because we don’t need to process any brackets or follow the operator precedence … Read more

Generally arithmetic expressions are written in infix expression where the operator is written between the operands. Point to consider Suppose given infix expression is A+B*C-D where A,B,C,D are operands and +,*,- are operators. To solve the above infix expression we will use two stack Operand Stack : This stack will hold operands. Operator Stack : … Read more

Infix, Postfix and Prefix notations are the ways of writing and evaluating Arithmetic & Algebraic expressions. Infix, prefix, and postfix are ways to write math expressions. Infix is what we use every day, like 2 + 3. Prefix, also called Polish notation, puts the operator before the numbers, like + 2 3. Postfix, or Reverse … Read more

A stack is a Linear Abstract Data Type (ADT) that follows the LIFO(Last in first out) property. There are two operation which can be performed on stack 1). PUSH 2). POP 1). PUSH operation of Stack PUSH operation of the stack is used to add an item to a stack at the top. We can … Read more

A stack is a fundamental data structure that follows the Last In, First Out (LIFO) principle, meaning the last element added to the stack will be the first one to be removed. It’s like a stack of plates, you add to the top and take from the top. This post will explore how to implement … Read more

Stack can be implemented by both array and linked list. There is some limitation or you can say that drawback in stack implementation using an array is that the array must be declared with some fixed size. In case if the size of the array becomes small to perform the required operation so this is … Read more

Dijkstra’s algorithm, given by a brilliant Dutch computer scientist and software engineer Dr. Edsger Dijkstra in 1959. Dijkstra’s algorithm is a greedy algorithm that solves the single-source shortest path problem for a directed and undirected graph that has non-negative edge weight. For Graph G = (V, E)w (u, v) ≥ 0 for each edge (u, … Read more