## Delete Middle Element of the Stack

In computer science, a stack is an abstract data type that represents a collection of elements, where the addition or removal of elements follows a Last-In-First-Out (LIFO) order. That is,...

Skip to content
## Delete Middle Element of the Stack

## Sort an array using stacks

## Delete Array Elements Which Are Smaller Than Next Or Become Smaller

## Check If A Queue Can Be Sorted Into Another Queue Using A Stack

## Conversion Infix notation to Prefix notation

## Conversion of Postfix expression to Infix expression

## Postfix to Prefix Conversion

## Conversion of Prefix to Postfix notation

## Conversion of Prefix expression to Infix expression

## Infix to Postfix Conversion using Stack

## Heap sort in Java

## Min Heap in Java

## Max Heap in Java

Get free ebooK with 50 must do coding Question for Product Based Companies solved

Fill the details & get ebook over email

Thank You!

We have sent the Ebook on 50 Must Do Coding Questions for Product Based Companies Solved over your email. All the best!

In computer science, a stack is an abstract data type that represents a collection of elements, where the addition or removal of elements follows a Last-In-First-Out (LIFO) order. That is,...

Problem statement Given an array of integers of size N , sort it in increasing order using a stack. Example : Sample input : 4 2 3 1 5 Sample...

Problem statement Given an array of integers of size n . You have to delete every element which is smaller than the next element or become smaller than the next...

Problem statement Given a queue having N numbers . Numbers in the queue is a permutation of first N natural numbers (1 to N) . You have to find out...

The conversion from infix notation to prefix notation involves reversing the order of the expression, replacing each operator with its corresponding prefix operator, and swapping the positions of each operand....

Problem statement Given an arithmetic expression in postfix notation , convert it into the equivalent infix notation. Sample example : Postfix Input : abc/-ad/e-* Infix output : ((a-(b/c))*((a/d)-e)) Postfix input...

Problem statement Given an arithmetic expression in postfix notation , convert it into the equivalent prefix notation. Sample example : Postfix input: abc/-ad/e-* Prefix output: *-a/bc-/ade Postfix input : ab*...

We have been given an arithmetic expression, and we have to write a program that converts prefix to postfix. The expression is given in the form of a string that...

Conversion of prefix expression to infix expression involves rearranging the operators and operands to follow the rules of infix notation while maintaining the order of operations. This can be achieved...

We have given an Arithmetic Expression and we have to write a program that converts the infix to postfix using stack in C. The Expression will be given in the...

What is heap? Heap is a special kind of complete binary tree in which the all node has a value greater (or smaller ) than all of its children ....

What is Heap? Heap is a special kind of complete binary tree in which the all node has a value greater (or smaller ) than all of its children ....

What is Heap? Heap is a special kind of complete binary tree in which the all node has a value greater (or smaller ) than all of its children ....