Merge sort is a very commonly used sorting technique for arranging data in a specific order. It is based on divide and conquer technique of algorithm designing. The complexity of…

# Category: Data Structures

Linear search is the most fundamental mechanism to search a give item in a small set of values. In this post we will understand working of Linear Search in Python…

Deletion in doubly linked list like insertion can be done at any location. You can delete a node at the beginning, at the end, after a given node or at…

Insertion in doubly linked list can be done at any location. The new node can be added at the beginning, at the end, after a given node or at a…

The singly or linear linked list comes with a limitation. You can traverse in only one direction. You can read nodes starting from first to the last by updating a…

Adding of polynomials is a very common operation in mathematics and other science subjects. Creating a program for adding of polynomials is quite tricky. If you create a program for…

Deletion in a Circular Queue Circular Queue Deletion is similar to deletion in a queue. The only difference is due to its characteristic of linking last element with the first…

Insertion in Circular Queue is similar to how insertion is done in a queue. Circular Queue is also implemented as FIFO (First In First Out) data structure. The circular nature…

Queue Deletion operation is also called dequeue. Queue works on FIFO (First In First Out) principle. The element added at the beginning of the queue is deleted first. A new…

Queue Insertion operation is also called enqueue. Queue operations implement FIFO (First In First Out) principle. The element added at the beginning of the queue is deleted first. A new…