# Tag: Data Structure tutorials

## Graph – Introductions, Explanations and Applications

A graph is a data structure defined as G(V, E) where V is a set of nodes and E is set of edges. Each edge is a pair

## Binary Heap – Introduction, Explanation and Implementation

A heap is a tree based data structure that follows, It’s a complete tree , all the levels are completely filled except possibly the last level where all

## How to Insert, Delete and traverse a Binary Search Tree – Explanation with example

Binary search tree is a binary tree with following properties: Left sub tree of a node always contains lesser key Right subtree of a node always contains greater

## Tree Traversal – BFS and DFS – Introduction, Explanation and Implementation

Traversing a tree refers to visiting each node once. Interestingly, a tree has multiple ways of traversing the nodes, unlike linked list and array which have just one

## 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

## 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