# algorithms and data structure Archive

Data Structure

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

Read More Data Structure

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

Read More Data Structure

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

Read More Data Structure

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

Read More Data Structure

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

Read More Data Structure

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

Read More Data Structure

In a circular linked list all nodes are connected in a continuous cycle. Each node has two part Data and Next as a singly linked list has. The

Read More algorithms

Heap Sort is comparison based sorting algorithm. It uses binary heap data structure. Heap Sort can be assumed as improvised version of Selection Sort where we find the

Read More Data Structure

In our previous post we have discussed about Linked lists and how to insert a node in a linked list(at the front, at the end and somewhere in

Read More Data Structure

Insertion to linked list can be done in three ways: Inserting a node at the front of linked list. Inserting a node at the end of linked list. Inserting a

Read More