See My Code

A monotonic stack is an extension of the Stack data structure in which the elements of the stack are in either increasing or decreasing order. The stack in which the items are in increasing order is called the monotonically increasing stack, the top element of such a stack will be the largest of all the elements below. On the other hand, if the items are arranged in a decreasing order then the stack is called a monotonically decreasing stack, on which the top element will be the smallest of all the elements below. Monotonic stacks are very popular in competitive programming.

 A linked list data structure can be doubly-linked as well as circular. In this article, a simple implementation of doubly linked list in C language is presented.

A double-ended queue, pronounced deque in short is a LIFO queue where entries can be pushed and popped at both the ends of the queue, apart from push and pop an additional peek method is also discussed which fetches the value at either ends without removing it. In this article, one such queue is implemented using the C language.

 A stack data structure is used on cases where the last-in-first-out (LIFO) is needed. For example, Undo is implemented using stack, ie., the most recently made change is undone first. The article explains a sample implementation of the stack using linked list in C.