In this tutorial We have explored an algorithm to convert a given Postfix expression to Infix expression using Stack. Algorithm For Postfix to Infix Conversion Iterate the given expression from left to right, one character at a time Step 1 : If a character is operand, push it to stack. Step 2: If a character … Read more

In infix to postfix conversion we will use stack data structure. We have operator’s stack, output’s stack and one input string. Operator’s stack works as FILO(First In Last Out). Output’s stack works as FIFO (First In First Out). Converting an infix expression to postfix is like changing the way we write math problems so computers … Read more

A circular queue is a linear data structure that follows FIFO principle. In circular queue, the last node is connected back to the first node to make a circle. In Circular queue elements are added at the rear and elements are deleted from front. We can represent circular queue using array as well as linked … Read more

The Tower of Hanoi is a mathematical Puzzle that consists of three towers(pegs) and multiple disks. Initially, all the disks are placed on one rod. And these disks are arranged on one over the other in ascending order of size. Read Here : Tower of Hanoi Program and Algo in details Steps to be followed … Read more

Priority Queue How priority queue is different from the normal queue? The difference between Priority Queue and Normal Queue is Normal queue Follows FIFO (first-in-first-out) rule whereas, in a priority queue, the values are removed on the basis of priority of the elements. The element with the highest priority will be removed first. There are … Read more

Circular Queue is a linear data structure that follows FIFO (First In First Out) principle. FIFO means item that inserted first in queue will be taken out first. Why Circular queue? There was a limitation in normal Queue that if rear reaches at the end of size of queue and there are some space left … Read more

What is Queue ? The process of inserting an element in the queue is called enqueue, and the process of deleting an element from the queue is called dequeue. For example: At Bus Stop, People is in queue and waiting for a bus. The person who is standing in the line at the first position … Read more

Recursion is a process in which a function calls itself again and again. We use recursion to solve bigger problem by dividing it into smaller similar sub-problems and then call them recursively. Types of Recursion Recursive functions can be classified on the basis of a) Based on functions call itself – Direct / Indirectb) Based … Read more

Recursion is a process in which a function calls itself again and again. We use recursion to solve the bigger problem by dividing it into smaller similar sub-problems and then call them recursively. In other words, we can also explain it as a problem is broken down into smaller subproblems. And a function applies the … Read more