## Binary Tree – Introduction, Explanation and Implementation

A specialized form of tree data structure in which each node can have at most two children, such a tree is referred as a Binary Tree. The Topmost node

## Tree – Introduction, Terminologies and Explanation

A tree is a hierarchical data structure, unlike array and linked list(which are known as a linear data structure). Saying hierarchy means nodes(or vertices) are ordered in top

## Priority Queue – Introduction, Explanation and Implementation

Priority Queue is a data structure which is similar to Queue and Stack. Moreover, it is an extension to queue with following properties Each item is associated with

## Python 3 Data Types – Lists – Explanation with examples

A List in python is a data type which acts as a container and holds different objects together in an order. A list is a mutable object, i.e.,

## Queue – Introduction, Explanation and Implementation

A queue is a data structure used to store items that has defined way of Insertion and Deletion operation. It follows First in First Out(FIFO) means items inserted

## Stack – Introduction, Explanation and Implementation

A stack is a data structure used to store items that has defined way of Insertion and Deletion operation. It follows Last in First Out(LIFO) means items inserted

## Shell Sort Algorithm- Explanation, Implementation and Complexity

Shell Sort is a generalized version of insertion sort. It is an in–place comparison sort. Shell Sort is also known as diminishing increment sort, it is one of

## Doubly Linked List – Explanation and Implementation

A doubly linked list is an advanced form of linked list which has the ability to traverse back and forth i.e. in both the direction. It possesses an