Category: Data Structures

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…

Data Structures Python

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…

Data Structures 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…

Data Structures

Data Structures

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…

Data Structures

Data Structures

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…

Data Structures

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…

Data Structures

Data Structures

Data Structures