Home Data Structures

# Data Structures

### Tree Traversal – Preorder, Inorder, Postorder

Traversing a Tree is done to visit each and every node of the tree. Since from a given node, there is more than one...

### Binary Search Tree Tutorial and Implementation

Binary Search Tree(BST) is a type of tree data structure which has the following properties: It should be a Binary Tree i.e, each node...

### Tree Data Structure Tutorial and application

A tree is a Data Structure composed of nodes, where each node is a data structure consisting of value, together with a list of...

### Convert any m-ary tree (General Tree) to a Binary Tree

We are given any m-ary tree, our goal is to convert that m-ary tree into a Binary Tree by following below steps: Insert an...

### Breadth First Search Algorithm for Graph Traversal (Recursive & Iterative approach)

Breadth-First Search is a recursive algorithm used to traverse a Graph. The algorithm starts with an arbitrary node(in case of a graph) and traverses...

### Depth First Search Algorithm for Graph Traversal

Depth First Search is a recursive algorithm used to traverse a Graph. The algorithm starts with an arbitrary node(in case of a graph) and...

### Data Structures (Introduction)

An Introduction Data Structures is a data organization, management, and storage format that enables efficient access and modification. Stack, Linked list, trees, graph, etc are...

### Linked List Tutorial and Implementation

The linked list is a linear data structure that is stored in non-contiguous fashion (unlike array) in the memory. Linked List consists of nodes...

### Queue Data Structue Tutorial and Implementation

The Queue is a Data Structure, supports the insertion and deletion of elements in particular order, i.e, FIFO (First In First Out). Whenever an...

### Stack Data Structure Tutorial and Implementation

The stack is a Data Structure that supports insertion and deletion of elements in a particular order, i.e, LIFO (Last In First Out). Whenever...