Skip to content

sameerkhan97/data-structure-implementations

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

60 Commits
Array All Operations.cpp
Array All Operations.cpp
 
 
Binary Search Tree Deletion(replacing by rightmost node).cpp
Binary Search Tree Deletion(replacing by rightmost node).cpp
 
 
Binary Search Tree Insertion,All Order Traversal.cpp
Binary Search Tree Insertion,All Order Traversal.cpp
 
 
Binary Search Tree deletion(all cases).cpp
Binary Search Tree deletion(all cases).cpp
 
 
Binary Tree Insertion,Inorder,Preorde,Postorder Traversal.cpp
Binary Tree Insertion,Inorder,Preorde,Postorder Traversal.cpp
 
 
Binary Tree Insertion.cpp
Binary Tree Insertion.cpp
 
 
Circular Linked list Traversal,Insertion,Deletion,Reverse.cpp
Circular Linked list Traversal,Insertion,Deletion,Reverse.cpp
 
 
Doubly Linked list Traversal,Insertion,Deletion,Reverse.cpp
Doubly Linked list Traversal,Insertion,Deletion,Reverse.cpp
 
 
GRAPH ---BFS using adjency matrix.cpp
GRAPH ---BFS using adjency matrix.cpp
 
 
GRAPH ---DFS using adjency matrix.cpp
GRAPH ---DFS using adjency matrix.cpp
 
 
HASH TABLE Insert,Delete,Search.cpp
HASH TABLE Insert,Delete,Search.cpp
 
 
Queue Using Array.cpp
Queue Using Array.cpp
 
 
Queue Using LL.cpp
Queue Using LL.cpp
 
 
README.md
README.md
 
 
Singly Linked list Traversal,Insertion,Deletion,Reverse.cpp
Singly Linked list Traversal,Insertion,Deletion,Reverse.cpp
 
 
Stack using Arrary.cpp
Stack using Arrary.cpp
 
 
Stack using Linked List.cpp
Stack using Linked List.cpp
 
 

Repository files navigation

DATA STRUCTURES IMPLEMENTATION

Project deals with the implementation of different types of DATA STURUCTURES.

Data structures play a very important role in programming. They provide the mechanism of storing the data in different ways. This optimizes searching and memory usage. Data structures play a central role in modern computer science. They enable an efficient storage of data for an easy access.They help in data protection and management.

The implementation of a data structure usually requires writing a set of procedures that create and manipulate instances of that structure The study includes a comparative implementations (i.e. Insertion,Deletion,Searching,Traversal etc.). The programming language used to implement these sorting algorithms is C++.

Array :

Linked List :

STACK :

QUEUE :

Binary Tree :

Binary Search Tree :

GRAPH

HASH TABLE

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages