Home Data Structures

# Data Structures

Data Structures

### Binary Search Tree Tutorial and Implementation

Nlogn Team - 0

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

Data Structures

### Tree Data Structure Tutorial and application

Nlogn Team - 0

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

Data Structures

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

Nlogn Team - 0

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

Data Structures

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

Nlogn Team - 0

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

Data Structures

### Depth First Search Algorithm for Graph Traversal

Nlogn Team - 0

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

### Data Structures (Introduction)

Nlogn Team - 1

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

Data Structures

### Linked List Tutorial and Implementation

Nlogn Team - 0

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

Data Structures

### Queue Data Structue Tutorial and Implementation

Nlogn Team - 0

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

Data Structures

### Stack Data Structure Tutorial and Implementation

Nlogn Team - 1

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

Data Structures

### Representation of a Graph using Adjacency List and Adjacency Matrix

Nlogn Team - 0

In computer science graph is a data structure consisting of vertices and edges. It is usually written as G(V, E) where V is a...

### Subscribe to our newsletter

To be updated with all the latest news, offers and special announcements.

Even we hate spam as much