Category: Data Structures

Traversal is an essential operation of any data structure. It is the process of reaching out to or visiting every element stored in the data structure at least once. Unlike…

Data Structures

Data Structures

A binary tree is a non-linear data structure to maintain binary relationships among elements.  Binary trees are special trees where a node can have maximum two child nodes. These are…

Data Structures

Quicksort is a sorting technique with algorithmic complexity of O(nlogn). This sorting technique too falls under divide and conquer technique like Merge Sort.  In this post we will discuss the…

Data Structures Python

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