DeepthiTabithaBennet / TheDataStructuresSurvivalKit

📚Everything you will EVER need to survive Data Structures, in C++. In collaboration with @PreethiSamanthaBennet✨

---

✨ The Data Structures Survival Kit ✨

In Collaboration with @PreethiSamanthaBennet !

---

Table Of Contents (Click to Expand) :

ARRAY

(click to view)

• Delete at a Specified Position

• Largest and Smallest Element in an Array

• Maximum Absolute Difference of an Array

• Merging Two Arrays Using Pointers

• Mode of an Array

• Number of Duplicate Elements

• Removal of Prime Numbers

• Removing Duplicate Elements

• Standard Deviation of an Array

STACK

(click to view)

• Stack - Class Based Implementation

• Stack - User Defined DataType as Elements

• Stack Using Linked List

• Balanced Parentheses Checker

• Stack with the Smallest Element always at the Bottom (Largest Element always at the Top)

• Stack with the Largest Element always at the Bottom (Smallest Element always at the Top)

• Queue Using Stack

• STL - Queue Using Stack

• Two Stacks using a Single Array

• Infix to Prefix

• Infix to Postfix

QUEUE

(click to view)

• Circular Queue - Class Based Implementation

• Circular Queue - User Defined DataType as Elements

• Queue Using Linked List

• Deque

• Sum of Larger elements at the ends of a Deque

• Comparison of Two Circular Queues

• Queue Using Stack

• STL - Queue Using Stack

TREE

(click to view)

• Binary Search Tree

• AVL Tree

• Splay Tree

• B-Tree

• B-Tree - Maximum and Minimum Element

HASH TABLE

(click to view)

• Hash Table - Class Based Implementation

• STL - Hash Table - Class Based Implementation

HEAP

(click to view)

• Min Heap

• Max Heap

• Binomial Heap

• Heap Using Linked List

SET

(click to view)

• Set

• Disjoint Sets

---

Please leave a 🌟 before you fork / clone this repo! 😃

---