Data-Structures-In-C

Implementation of Data Structures like Stacks, Queues, etc. using C programming language.

Programs Included -

Stack ADT

Queue ADT

Circular Queue ADT

Priority Queue (TODO)

Infix to Postfix conversion using Stack

Infix to Prefix conversion using Stack

Linked List ADT (TODO)

Polynomial Evaluation through Linked List

Message Queue using Circular Queue

Sparse Matrix Using Double Linked List

Hashing Using Linear Probing

Expression Tree

Merge Sort

Quick Sort

Depth First Search

Breadth First Search

Name	Name	Last commit message	Last commit date
Latest commit History 111 Commits 111 Commits
.github	.github
Addition of 2 Large Numbers using Circular Linked List	Addition of 2 Large Numbers using Circular Linked List
Binary Search Tree	Binary Search Tree
Breadth First Search	Breadth First Search
Circular Queue ADT	Circular Queue ADT
Depth First Search	Depth First Search
Expression Tree	Expression Tree
Hashing Using Linear Probing	Hashing Using Linear Probing
Infix to Postfix (Stack)	Infix to Postfix (Stack)
Infix to Prefix(Stack)	Infix to Prefix(Stack)
Knapsack Problem	Knapsack Problem
Linked List ADT	Linked List ADT
Merge Sort	Merge Sort
Message Queue(Circular Queue)	Message Queue(Circular Queue)
Polynomial Evaluation through Linked List	Polynomial Evaluation through Linked List
Priority Queue ADT	Priority Queue ADT
Queue ADT	Queue ADT
Quick Sort	Quick Sort
Sparse Matrix using Double Linked List	Sparse Matrix using Double Linked List
Stack ADT	Stack ADT
books	books
CONTRIBUTING.md	CONTRIBUTING.md
LICENSE	LICENSE
README.md	README.md

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Data-Structures-In-C

Stack ADT

Queue ADT

Circular Queue ADT

Priority Queue (TODO)

Infix to Postfix conversion using Stack

Infix to Prefix conversion using Stack

Linked List ADT (TODO)

Polynomial Evaluation through Linked List

Message Queue using Circular Queue

Sparse Matrix Using Double Linked List

Hashing Using Linear Probing

Expression Tree

Merge Sort

Quick Sort

Depth First Search

Breadth First Search

About

Releases

Packages

Used by

Contributors

Languages

Search code, repositories, users, issues, pull requests...

Folders and files

Latest commit

History

Repository files navigation

Data-Structures-In-C

Stack ADT

Queue ADT

Circular Queue ADT

Priority Queue (TODO)

Infix to Postfix conversion using Stack

Infix to Prefix conversion using Stack

Linked List ADT (TODO)

Polynomial Evaluation through Linked List

Message Queue using Circular Queue

Sparse Matrix Using Double Linked List

Hashing Using Linear Probing

Expression Tree

Merge Sort

Quick Sort

Depth First Search

Breadth First Search

About

Topics

Resources

Code of conduct

Contributing

Stars

Watchers

Forks

Releases

Packages

Used by

Contributors

Languages