DSA-I

This repository contains some of the applications of Stacks, Heaps, Tries, Trees and Graphs.

Thanks @neeldhara for providing such a wonderful course!

Reference: - From the DSA-I course taken by @neeldhara at IITGN, Some codes (eg. Queue, Heap Imlementation etc.) are referenced from Geeks for Geeks.

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
AVL-Insertion, Deletion, Search.c		AVL-Insertion, Deletion, Search.c
BST-Height.c		BST-Height.c
BST-Insertion, Deletion, Search.c		BST-Insertion, Deletion, Search.c
BST-Postorder from Preorder.c		BST-Postorder from Preorder.c
Bellman-Ford.c		Bellman-Ford.c
Dijkstra.c		Dijkstra.c
Floyd Warshell.c		Floyd Warshell.c
Heap-Insertion, Updater.c		Heap-Insertion, Updater.c
ISHeap.c		ISHeap.c
Longest Path in DAG.c		Longest Path in DAG.c
Prims.c		Prims.c
README.md		README.md
Shortest Distance - Unweighted Graph - BFS.c		Shortest Distance - Unweighted Graph - BFS.c
Spruce Check.c		Spruce Check.c
Stack-Right Nearest.c		Stack-Right Nearest.c
Suffix Array - DFS.c		Suffix Array - DFS.c
Topological Sorting of DAG.c		Topological Sorting of DAG.c
Tries-Insertion, Deletion, Search.c		Tries-Insertion, Deletion, Search.c
Tries-Number of Suffixes.c		Tries-Number of Suffixes.c
Tries-Prefix Count.c		Tries-Prefix Count.c

Provide feedback