A passionate Software Engineer from Bangladesh. I am in the early stages of learning to code.
This repo shows the code for some basic data structures.
singly linked list:
*insert at head
*insert at tail
*insert at any position
*delete from any position
*delete from head
doubly linked list:
*insert at head
*insert at tail
*insert at any position
*delete from any position
*delete from head
STL List
Stack Implementation
*stack using array
*stack using dubly linked list
*stack using list
*STL stack
Queue 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
