Data Structure
Programming = Data Structures + Algorithms. Time & Memory is always a concern while solving a problem. Data Structure is a particular way of organizing the data so that it can be accessed and modified efficiently.
Course Features
Start Learning From Scratch
Our courses are designed in such a way that even an absolute beginner can start to learn and solve problems.
Puzzles & Practice Problems
Once you learned the concepts, you can test your knowledge by solving puzzles and practice problems.
Access to New Contents
We will incrementally add more content to this package. And the new contents will be automatically added to your account.
Course Completion Certificate
Once you complete all learning modules and practice sessions. Then you will get the course completion certificate.
Course Syllabus
Data Structures and its Real life Applications
Array In Data Structure

Introduction to Array

Inserting An Element In Array

Searching An Element In Array

Removing An Element In Array
Linked List

Linked list Basics

Inserting a node at the beginning of a linked list

Inserting a node at the end of Linked list

Deleting a node in linked list

Why do we use **head in deleteNode function?

Searching a node in singly linked list

Linked list vs Array
Doubly Linked List

Introduction to Doubly linked list

Insert a node at beginning of a doubly linked list

Insert a node at end of a doubly linked list

Search a node in doubly linked list

Delete a node in a doubly linked list
Circular Linked List

Circular Linked list Basics

Inserting a node in a beginning of circular linked list

Inserting a node in the end of circular linked list

Search a node in circular linked list

Deleting a node in circular linked list
Stack
Queue
Binary Heaps

Why & What is Binary heap (Priority Queue)

Constructing Binary Heap  Heapify

Delete a Maximum element in Binary Heap
Binary Search Tree

Binary Tree basics

Need for Binary Search Tree

Binary Search Tree Basics and Node creation

Binary Recursion

Insert a node in Binary Search Tree

Inorder traversal

Search a node in Binary Search Tree

Delete a node in Binary Search Tree
Graphs

Graph Basics Degree of Vertex

Adjacency matrix representation of graph

Implementation of Adjacency Matrix

Adjacency list representation of graph

Implementation of Adjacency list

Adjacency matrix Vs Adjacency list representation