Data Structures in C++

Note :
main.cpp in this repo use an include file that needs to be compiled manually so
If you will use the main.cpp included in the repo so Use the command below to compile and run
you must compile the code in terminal manually to work

# to compile the file
$ g++ main.cpp -o main -D FILENAME # FILENAME is the file (specific data sturcture from include.h file) you want to use
# to run
$ ./main.exe 

- All of these Data Structures were built using Templates
- Functions in README are the basic functions only

Hope you find this repository helpful, Have a nice time diving in

You can have a look to my Algorithms also

Table of Contents:

1. Vector
2. Singly LinkedList
3. Doubly LinkedList
4. Sparse Array Using LinkedList
5. Sparse Matrix Using LinkedList
6. Sparse Cube Using LinkedList
7. Stack Array Based
8. Stack LinkedList Based
9. Circular Queue
10. Queue LinkedList Based
11. Deque
12. Binary Tree
13. Binary Search Tree ( Binary Node )
14. Binary Search Tree
15. Min Binary Heap
16. Max Binary Heap
17. AVL Tree ( Binary Node )
18. AVL Tree
19. Priority Queue Heap Based
20. Priority Queue AVL Tree Based
21. Trie Tree ( Letter )
22. Hash Table

Contents:

• Vector

  • Push Back
  • Insert
  • Pop
  • Rotate (Left - Right)
  • Find
  • Find Transposition

• Singly LinkedList

  • Insert (End - Front - After - Alternative)
  • Search
  • Delete (First - Last)

• Doubly LinkedList

  • Insert (End - Front - Sorted)
  • Delete (Front - End)
  • Is Palindrom
  • Middle Value

• Sparse Array Using LinkedList

  • Print Row
  • Print Row Non zero

• Sparse Matrix Using LinkedList

  • Print Matrix
  • Print Matrix Non zero

• Sparse Cube Using LinkedList

  • Print Cube
  • Print Cube Non zero

• Stack Array Based

  • Is Full
  • Is Empty
  • Push
  • Pop
  • Peek
  • Reverse (Subwords - Num)
  • Remove Adjacent Duplicates
  • Reverse
  • Insert at Bottom

• Stack LinkedList Based

  • Push
  • Pop
  • Peek

• Circular Queue

  • Is Full
  • Is Empty
  • Next
  • Enqueue
  • Dequeue

• Queue LinkedList Based

  • Is Empty
  • Enqueue
  • Dequeue

• Deque

  • Next
  • Prev
  • Enqueue (Rear - Front)
  • Dequeue (Rear - Front)
  • Is Empty
  • Is Full

• Binary Tree

  • Print (Pre order - Post order - In order)
  • Tree max
  • Tree Height
  • Is exists
  • Is Perfect
  • Traverse
  • Level order Traversal
  • Is Mirror
  • Is symmetric
  • Is Flip

• Binary Search Tree ( Binary Node )

  • Insert
  • Search
  • Level Order Traversal

• Binary Search Tree

  • Insert
  • Search
  • Delete
  • Get (In Order - Pre Order)

• Min Binary Heap

  • Push
  • Pop
  • Is empty
  • Heap Sort

• Max Binary Heap

  • Push
  • Pop
  • Top
  • Is Empty

• AVL Tree ( Binary Node )

  • Insert
  • Search
  • Delete
  • Level Order Traversal
  • Lower Bound
  • Upper Bound
  • Prefix Exist

• AVL Tree

  • Insert
  • Delete
  • Level Order Traversal

• Priority Queue Heap Based

  • Is Empty
  • Enqueue
  • Dequeue

• Priority Queue AVL Tree Based

  • Is Empty
  • Enqueue
  • Dequeue

• Trie Tree ( Letter )

  • Insert
  • Word Exist
  • Prefix Exist

• Hash Table

  • Hash Table LinkedList Based ( Chaining Technique )
  • Hash Table Vector Based ( Chaining Technique )
  • Hash Table Vector Based ( Linear Probing Technique )
  • Hash Table Vector Based ( Quadratic Probing Technique )