TheDataStructuresSurvivalKit

KO | EN

gitlite — search

#javascript #python #hacktoberfest #react #ai #typescript #llm #go #golang #android #machine-learning #rust #deep-learning #linux

TheDataStructuresSurvivalKit

★ 9 Open GitHub ↗

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

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

[![License: BSD-3-Clause](https://img.shields.io/badge/License-BSD_3--Clause-blue.svg?style=for-the-badge)](https://opensource.org/licenses/BSD-3-Clause)   ![Repo-Created-on: 21st-May-2021](https://img.shields.io/badge/Repo_Created_on-21st_May_2021-blue.svg?style=for-the-badge)

----

# ✨ The Data Structures Survival Kit ✨

### In Collaboration with [`@PreethiSamanthaBennet`](https://github.com/PreethiSamanthaBennet) !

----

### Table Of Contents _(Click to Expand)_ :

[//]: # (---------------------------------------------------------------------------------------------)

<details>
<summary> ARRAY </summary>
 
 
 _(click to view)_
 
 * [Delete at a Specified Position](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Array/Delete_at_Specified_Position.cpp)
 
 * [Largest and Smallest Element in an Array](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Array/Largest_and_Smallest_Element_in_an_Array.cpp) 
 
 * [Maximum Absolute Difference of an Array](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Array/Maximum_Absolute_Difference.cpp)
 
 * [Merging Two Arrays Using Pointers](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Array/Merge_Two_Arrays_Using_Pointers.cpp)
 
 * [Mode of an Array](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Array/Mode_of_an_Array.cpp)
 
 * [Number of Duplicate Elements](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Array/Number_of_Duplicate_Elements.cpp)
 
 * [Removal of Prime Numbers](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Array/Removal_of_Prime_Numbers.cpp)
 
 * [Removing Duplicate Elements](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Array/Removing_Duplicate_Elements.cpp)
 
 * [Standard Deviation of an Array](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Array/Standard_Deviation.c)

</details>

[//]: # (---------------------------------------------------------------------------------------------)

<details>
<summary> STACK </summary>
 
 
 _(click to view)_
 
 * [Stack - Class Based Implementation](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Stack/Stack.cpp)
 
 * [Stack - User Defined DataType as Elements](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Stack/Stack_User_Defined_Datatype_Elements.cpp)
 
 * [Stack Using Linked List](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Stack/Stack_Using_Linked_List.cpp)
 
 * [Balanced Parentheses Checker](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Stack/Balanced_Parentheses_Checker.cpp)
 
 * [Stack with the Smallest Element always at the Bottom (Largest Element always at the Top)](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Stack/Smallest_Element_at_Bottom.cpp)
 
 * [Stack with the Largest Element always at the Bottom (Smallest Element always at the Top)](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Stack/Largest_Element_at_Bottom.cpp)
 
 * [Queue Using Stack](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Stack/Queue_Using_Stack.cpp)
 
 * [STL - Queue Using Stack](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Stack/STL_Queue_Using_Stack.cpp)
 
 * [Two Stacks using a Single Array](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Stack/Two_Stacks_With_Single_Array.cpp)
 
 * [Infix to Prefix](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Stack/Infix_to_Prefix.cpp)
 
 * [Infix to Postfix](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Stack/Infix_to_Postfix.cpp)
 

</details>

[//]: # (---------------------------------------------------------------------------------------------)

<details>
<summary> QUEUE </summary>
 
 
 _(click to view)_
 
 * [Circular Queue - Class Based Implementation](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Queue/Circular_Queue.cpp)
 
 * [Circular Queue - User Defined DataType as Elements](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Queue/Circular_Queue_User_Defined_Datatype_Elements.cpp)
 
 * [Queue Using Linked List](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Queue/Queue_Using_Linked_List.cpp)
 
 * [Deque](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Queue/Deque.cpp)
 
 * [Sum of Larger elements at the ends of a Deque](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Queue/Deque_SumOfLargerElementsAtEnds.cpp)
 
 * [Comparison of Two Circular Queues](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Queue/Comparison_of_Two_Circular_Queues.cpp)
 
 * [Queue Using Stack](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Queue/Queue_Using_Stack.cpp)
 
 * [STL - Queue Using Stack](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Queue/STL_Queue_Using_Stack.cpp)

</details>

[//]: # (---------------------------------------------------------------------------------------------)

<details>
<summary> TREE </summary>
 
 
 _(click to view)_

* [Binary Search Tree](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Tree/Binary_Search_Tree.cpp)
 
  * [AVL Tree](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Tree/AVL_Tree.cpp)
  
  * [Splay Tree](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Tree/Splay_Tree.cpp)
     
  * [B-Tree](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Tree/B-Tree.cpp)
     
  * [B-Tree - Maximum and Minimum Element](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Tree/B-Tree_Maximum_And_Minimum_Element.cpp)

</details>
 
[//]: # (---------------------------------------------------------------------------------------------)

<details>
<summary> HASH TABLE </summary>
 
 
 _(click to view)_

* [Hash Table - Class Based Implementation](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/HashTable/HashTable.cpp)
 
  * [STL - Hash Table - Class Based Implementation](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/HashTable/STL_HashTable.cpp)

</details>
 
[//]: # (---------------------------------------------------------------------------------------------)

<details>
<summary> HEAP </summary>
 
 
 _(click to view)_
 
 * [Min Heap](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Heap/MinHeap.cpp)
 
 * [Max Heap](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Heap/MaxHeap.cpp)
 
 * [Binomial Heap](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Heap/Binomial_Heap.cpp)
 
 * [Heap Using Linked List](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Heap/Heap_Using_Linked_List.cpp)

</details>

[//]: # (---------------------------------------------------------------------------------------------)

<details>
<summary> SET </summary>
 
 
 _(click to view)_

* [Set](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Set/Set.cpp)
 
  * [Disjoint Sets](https://github.com/DeepthiTabithaBennet/TheDataStructuresSurvivalKit/blob/main/Set/Disjoint_Set.cpp)

</details>

----

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

----

TheDataStructuresSurvivalKit

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

TheDataStructuresSurvivalKit

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README