42 lines (32 loc) · 1009 Bytes

Mustafa Saktaş

Data Structures Assignments (C)

This repository contains C implementations of fundamental data structures and algorithms developed as part of the Data Structures course.

Implemented Topics

Array insertion, deletion and update operations
Sparse Matrix representation
Stack-based Shunting Yard algorithm (Infix to Postfix)
Min Heap and Max Heap implementations
Singly Linked List
Doubly Linked List
Circular Linked List
Depth First Search (DFS)
Breadth First Search (BFS)
Graph cluster detection (Connected Components)
Tower of Hanoi (recursive solution)
Tree creation using array representation

File Structure

ArrayWFunction.c
SparseMatrix.c
ShuntingYard.c
MinveMaxHeap.c
CircularLinkedList.c
DoubleLinkedList.c
DFSandBFS.c
GraphCluster.c
Hanoi.c
TreeViaArray.c

Student Information

Name: Mustafa Saktaş

All implementations are written in C language and are intended for educational purposes.