Data Structures

Relevant source files

• DIRECTORY.md
• src/main/java/com/thealgorithms/ciphers/XORCipher.java
• src/main/java/com/thealgorithms/conversions/IntegerToEnglish.java
• src/main/java/com/thealgorithms/datastructures/heaps/Heap.java
• src/main/java/com/thealgorithms/datastructures/heaps/HeapElement.java
• src/main/java/com/thealgorithms/datastructures/lists/README.md
• src/main/java/com/thealgorithms/datastructures/lists/RandomNode.java
• src/main/java/com/thealgorithms/datastructures/lists/TortoiseHareAlgo.java
• src/main/java/com/thealgorithms/devutils/nodes/LargeTreeNode.java
• src/main/java/com/thealgorithms/devutils/searches/MatrixSearchAlgorithm.java
• src/main/java/com/thealgorithms/maths/LinearDiophantineEquationsSolver.java
• src/main/java/com/thealgorithms/others/CRCAlgorithm.java
• src/main/java/com/thealgorithms/searches/QuickSelect.java
• src/main/java/com/thealgorithms/searches/RowColumnWiseSorted2dArrayBinarySearch.java
• src/main/java/com/thealgorithms/sorts/CountingSort.java
• src/main/java/com/thealgorithms/sorts/LinkListSort.java
• src/main/java/com/thealgorithms/sorts/MergeSortRecursive.java
• src/test/java/com/thealgorithms/ciphers/XORCipherTest.java
• src/test/java/com/thealgorithms/conversions/IntegerToEnglishTest.java
• src/test/java/com/thealgorithms/datastructures/heaps/HeapElementTest.java
• src/test/java/com/thealgorithms/datastructures/heaps/MaxHeapTest.java
• src/test/java/com/thealgorithms/datastructures/heaps/MinHeapTest.java
• src/test/java/com/thealgorithms/datastructures/lists/TortoiseHareAlgoTest.java
• src/test/java/com/thealgorithms/maths/LinearDiophantineEquationsSolverTest.java
• src/test/java/com/thealgorithms/searches/QuickSelectTest.java
• src/test/java/com/thealgorithms/searches/RowColumnWiseSorted2dArrayBinarySearchTest.java
• src/test/java/com/thealgorithms/sorts/CountingSortTest.java

This page provides a comprehensive overview of the data structure implementations in the TheAlgorithms/Java repository. These implementations are intended for educational purposes to help understand the inner workings, properties, and applications of various data structures. For algorithms that operate on these data structures, see the related pages in the Algorithms section.

Data Structure Overview

The repository contains numerous data structure implementations organized into logical categories. Each implementation comes with comprehensive documentation and tests to demonstrate usage patterns and edge cases.

Sources:

• DIRECTORY.md122-268
• src/main/java/com/thealgorithms/datastructures

Heap Implementations

Heaps are tree-based data structures that satisfy the heap property, making them efficient for priority queue operations. For details, see Heap Implementations.

Heap Class Hierarchy

Sources:

• src/main/java/com/thealgorithms/datastructures/heaps/Heap.java1-35
• src/main/java/com/thealgorithms/datastructures/heaps/HeapElement.java25-173
• src/main/java/com/thealgorithms/datastructures/heaps/MinHeap.java1-270
• src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java1-248

List Implementations

Lists are linear data structures that store elements in a sequential manner. The repository contains various linked list implementations with different characteristics and operations. For details, see List Implementations.

List Implementations Overview

Sources:

• src/main/java/com/thealgorithms/datastructures/lists/SinglyLinkedList.java1-476
• src/main/java/com/thealgorithms/datastructures/lists/README.md1-34

Cache Implementations

Caches are data structures designed to store frequently accessed data for faster retrieval. The repository includes implementations of common caching strategies like LRUCache and LFUCache. For details, see Cache Implementations.

Sources:

• src/main/java/com/thealgorithms/datastructures/caches/LRUCache.java
• src/main/java/com/thealgorithms/datastructures/caches/LFUCache.java

Tree Data Structures

Trees are hierarchical data structures consisting of nodes connected by edges. The repository includes various tree implementations optimized for different operations, such as AVLTree, RedBlackBST, and Trie. For details, see Tree Data Structures.

Sources:

• src/main/java/com/thealgorithms/datastructures/trees/RedBlackBST.java1-253
• src/main/java/com/thealgorithms/datastructures/trees/Trie.java1-259

Queue Implementations

Queues are FIFO (First-In-First-Out) data structures where elements are inserted at the rear and removed from the front. The repository includes CircularQueue, LinkedQueue, and PriorityQueues. For details, see Queue Implementations.

Sources:

• src/main/java/com/thealgorithms/datastructures/queues/CircularQueue.java
• src/main/java/com/thealgorithms/datastructures/queues/LinkedQueue.java

HashMap Implementation

HashMap is a data structure that implements an associative array, mapping keys to values. The repository includes several HashMap implementations with different collision resolution strategies, including LinearProbingHashMap and HashMapCuckooHashing. For details, see HashMap Implementation.

Sources:

• src/main/java/com/thealgorithms/datastructures/hashmap/hashing/LinearProbingHashMap.java
• src/main/java/com/thealgorithms/datastructures/hashmap/hashing/HashMapCuckooHashing.java

Specialized Data Structures

The repository also includes several specialized data structures for specific use cases, such as BloomFilter, DisjointSetUnion, and DynamicArray. For details, see Specialized Data Structures.

Specialized Structures Relationship

Sources:

• src/main/java/com/thealgorithms/datastructures/bloomfilter/BloomFilter.java
• src/main/java/com/thealgorithms/datastructures/dynamicarray/DynamicArray.java
• src/main/java/com/thealgorithms/datastructures/crdt/GCounter.java

Conclusion

This page has provided an overview of the numerous data structure implementations available in the TheAlgorithms/Java repository. Each implementation is designed to demonstrate the properties, operations, and trade-offs of different data structures, making them valuable for both learning and reference purposes.

For algorithm implementations that operate on these data structures, please refer to the Algorithms section.

Sources:

• DIRECTORY.md122-268
• src/main/java/com/thealgorithms/datastructures