Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/rakibul263/data-structure
Use this C++ GitHub repository to explore the world of fundamental data structures. Implementations of arrays, linked lists, stacks, queues, trees, and more that are tidy and modular. Improve your knowledge of algorithms, learn to program, and find effective solutions to issues. With C++
https://github.com/rakibul263/data-structure
data-structures
Last synced: about 3 hours ago
JSON representation
Use this C++ GitHub repository to explore the world of fundamental data structures. Implementations of arrays, linked lists, stacks, queues, trees, and more that are tidy and modular. Improve your knowledge of algorithms, learn to program, and find effective solutions to issues. With C++
- Host: GitHub
- URL: https://github.com/rakibul263/data-structure
- Owner: rakibul263
- Created: 2023-12-30T05:57:48.000Z (about 1 year ago)
- Default Branch: master
- Last Pushed: 2024-01-20T13:49:34.000Z (12 months ago)
- Last Synced: 2024-01-21T10:45:02.462Z (12 months ago)
- Topics: data-structures
- Language: C++
- Homepage:
- Size: 60.5 KB
- Stars: 1
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## Data Structure with C++
# Project Title
A passionate Software Engineer from Bangladesh. I am in the early stages of learning to code.
# Project Title
This repo shows the code for some basic data structures.
# Here--
singly linked list:
*insert at head
*insert at tail
*insert at any position
*delete from any position
*delete from headdoubly linked list:
*insert at head
*insert at tail
*insert at any position
*delete from any position
*delete from headSTL List
Stack Implementation
*stack using array
*stack using dubly linked list
*stack using list
*STL stackQueue Inplementaion
*Queue Implementation using dubly linked list
*Queue Implementation using singly linked list
*Queue Implementation using STL linked list
*STL Queue
Binary Search Tree Implementation
*insert_BST
*search BST
*convert array to BST
Heap Implementation
*Delete From max heap
*delete from min heap
*input in max heap O(NlogN)
*insert max heap
*insert min heap
STL priority Queue Map and Set
*custom compare class
*priority queue min heap
*priority Queue max heap
*set
*STL map
*word count
![Logo](https://www.springboard.com/blog/wp-content/uploads/2020/07/what-are-data-structures-and-algorithms.png)
Author :
###
MD: RAKIUBL HASAN
###
B.Sc in Computer Science Engineering
###
Daffodil International University
###
Contact:
###
###