This repository contains implementations of fundamental data structures using C and C++. It is designed for students and developers to practice and better understand how data structures work at a low level.
The repository includes the following data structure implementations:
- Singly Linked List
- Creating a linked list
- Adding and displaying structures
- Doubly Linked List
- Node deletion operations
- Circular Linked List
- Adding and reading elements
- Stack
- Stack creation and basic functions
- Binary Tree
- Binary tree structure and traversal
- Time Analysis
- Simple algorithm performance analysis
- C++ Sample
- C++ implementation of basic structures
| File Name | Description |
|---|---|
create-Linked-list.c |
Create a singly linked list |
adding-and-showing-struct-linked-list.c |
Add and display structures in a list |
doubly linked list delete functions.c |
Delete operations in a doubly linked list |
Circle-Linked-List.c |
Circular linked list implementation |
Create Stack.c |
Basic stack implementation |
BinaryTree.c |
Binary tree operations |
time_analysis.c |
Time analysis of basic algorithms |
odev1_233301076.cpp |
Sample C++ implementation |
git clone https://github.com/MEK-0/data-structures.git
cd data-structures
****