Skip to content

Avineesh28/Data-Structures

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
BFS.c
BFS.c
 
 
BST Dictionary.cpp
BST Dictionary.cpp
 
 
BST Kth Largest Element.c
BST Kth Largest Element.c
 
 
BST Operations.c
BST Operations.c
 
 
BST.c
BST.c
 
 
BST_delete.c
BST_delete.c
 
 
BST_insert.c
BST_insert.c
 
 
Circular Linked List.c
Circular Linked List.c
 
 
Circular Queues.cpp
Circular Queues.cpp
 
 
DEQueue.cpp
DEQueue.cpp
 
 
DFS.c
DFS.c
 
 
Doubly Linked List.cpp
Doubly Linked List.cpp
 
 
InfixToPostfix.c
InfixToPostfix.c
 
 
Josephus Circle.c
Josephus Circle.c
 
 
Linked List.cpp
Linked List.cpp
 
 
List 2.py
List 2.py
 
 
List.py
List.py
 
 
Polynomial.c
Polynomial.c
 
 
Polynomial.cpp
Polynomial.cpp
 
 
Priority Queue.cpp
Priority Queue.cpp
 
 
Queue.java
Queue.java
 
 
Queues.cpp
Queues.cpp
 
 
README.md
README.md
 
 
Sets.py
Sets.py
 
 
Stack.java
Stack.java
 
 
Stacks.cpp
Stacks.cpp
 
 
Tree_traversal_code.c
Tree_traversal_code.c
 
 

Repository files navigation

Data-Structures

Basically all the types of Data Structures and their Applications that you'll ever need Stacks Queues-Priority, Circular,Doubly Ended Using Arrays and Linked Lists Trees-Tree traversal,Insertion,Deletion,kth Min,Min and Max Graph-DFS BFS

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages