data-structures - GitLite

KO | EN

gitlite — search

#ai #golang #machine-learning #linux #java #windows #cli #kubernetes #vue #awesome-list #security #ios #openai #open-source

data-structures

(★ 150)

This repository contains some data structures implementation in C programming language. I wrote the tutorial posts about these data structures on my personal blog site in Bengali language. If you know Bengali then visit my site

File Explorer

Download Latest Version (.zip)

- Binary Search Tree - Delete any node.c
- Binary Search Tree [Find Maximum and Minimum value].c
- Binary Search Tree [Insert-Search-Traverse] .c
- Circular Doubly Linked List (Insert, Delete, Print).c
- Circular Singly Linked List.c
- Deque - Double Ended Queue.cpp
- Doubly Linked List (Insert, Delete, Print).c
- Doubly Linked List (Insert, print: forward and revesre order).c
- Infix to Postfix and Postfix evaluation.cpp
- Is it a BST or not.c
- Linked List [create, insert, delete, search].c
- Linked List.c
- Parentheses Balance Checking using Stack.cpp
- Queue Implementation in C.cpp
- Stack Implementation in C.cpp
README.md

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Data Structures

In this repository I'll add all of my data structures implementations. Most of them are implemented by C programming language.

If you know Bengali go to my personal blog site for tutorials on these topics: http://hellohasan.com/category/data-structure/

Enjoy! :)

### **Data Structures List:**

#### Linear Data Structure:
- [Stack - Basic Implementation](https://github.com/hasancse91/data-structures/blob/master/Source%20Code/Stack%20Implementation%20in%20C.cpp)
- [Stack - Parentheses Balance Checking](https://github.com/hasancse91/data-structures/blob/master/Source%20Code/Parentheses%20Balance%20Checking%20using%20Stack.cpp)
- [Queue - Basic Implementation](https://github.com/hasancse91/data-structures/blob/master/Source%20Code/Queue%20Implementation%20in%20C.cpp)
- [Conversion of Infix to Postfix notation. Evaluation of Postfix notation](https://github.com/hasancse91/data-structures/blob/master/Source%20Code/Infix%20to%20Postfix%20and%20Postfix%20evaluation.cpp)
- [Deque – Double-Ended Queue](https://github.com/hasancse91/data-structures/blob/master/Source%20Code/Deque%20-%20Double%20Ended%20Queue.cpp)
- [Singly Linked List: Create, Print and Count the Item](https://github.com/hasancse91/data-structures/blob/master/Source%20Code/Linked%20List.c)
- [Singly Linked List: Create, Insert, Search, Delete and Print operation](https://github.com/hasancse91/data-structures/blob/master/Source%20Code/Linked%20List%20%5Bcreate%2C%20insert%2C%20delete%2C%20search%5D.c)
- [Doubly Linked List: Insert, Print the list forward and reverse order](https://github.com/hasancse91/data-structures/blob/master/Source%20Code/Doubly%20Linked%20List%20(Insert%2C%20print:%20forward%20and%20revesre%20order).c)
- [Doubly Linked List: Insert, Delete, Print the list forward and reverse order](https://github.com/hasancse91/data-structures/blob/master/Source%20Code/Doubly%20Linked%20List%20(Insert%2C%20Delete%2C%20Print).c)
- [Circular Singly Linked List: Insert, Delete, Traverse (Print)](https://github.com/hasancse91/data-structures/blob/e2d04b144df53b67e9b731eb138b27f4f1ce3ba0/Source%20Code/Circular%20Singly%20Linked%20List.c)
- [Circular Doubly Linked List: Insert, Delete, Traverse (print) Forward order and Reverse order](https://github.com/hasancse91/data-structures/blob/master/Source%20Code/Circular%20Doubly%20Linked%20List%20(Insert%2C%20Delete%2C%20Print).c)

#### Non-Linear Data Structure:
- [Tree - Binary Search Tree - BST [Insert, Search and Traversal]](https://github.com/hasancse91/data-structures/blob/master/Source%20Code/Binary%20Search%20Tree%20%5BInsert-Search-Traverse%5D%20.c)
- [Tree – Binary Search Tree – BST [Find Maximum and Minimum value]](https://github.com/hasancse91/data-structures/blob/master/Source%20Code/Binary%20Search%20Tree%20%5BFind%20Maximum%20and%20Minimum%20value%5D.c)
- [Tree – Binary Search Tree – BST [Delete any node of BST]](https://github.com/hasancse91/data-structures/blob/master/Source%20Code/Binary%20Search%20Tree%20-%20Delete%20any%20node.c)
- [Tree – Binary Search Tree – BST [Checking: Is it a BST or Not?]](https://github.com/hasancse91/data-structures/blob/master/Source%20Code/Is%20it%20a%20BST%20or%20not.c)