Data Structures Implementations

This repository is a collection of implementations of various data structures.

Overview

Vector / Dynamic Array

• with allocator
• Iterators:
  • Iterator
  • Const Iterator
  • Reverse Iterator

Singly Linked List

• Structure:
  • Linked Nodes (with next pointer)
• Iterators:
  • Iterator
  • Const Iterator

Doubly Linked List

• Structure:
  • Linked Nodes (with both previous and next pointers)
• Iterators:
  • Iterator
  • Const Iterator

Stack

• Structure:
  • Linked Implementation
  • Array Implementation
  • Template Container Implementation

Queue

• Structure:
  • Linked Implementation
  • Array Implementation
  • Template Container Implementation

Deque

• Structure:
  • Linked Implementation
  • Array Implementation
• Iterators:
  • Iterator

Set/Map

• Structure:
  • Binary Search Tree
• Iterators:
  • Const Iterator
• Additional Features:
  • Custom Comparator

Priority Queue

• Structure:
  • Binary Heap

Unordered Map/Set

• Structure:
  • Separate Chaining
• Iterators:
  • Const Iterator
• Additional Features:
  • Template Hasher

Unordered Map/Set (Preserves Insertion Order)

• Structure:
  • Separate Chaining
• Iterators:
  • Const Iterator
• Additional Features:
  • Template Hasher

Unordered Map/Set (Linear Probing)

• Structure:
  • Linear Probing
• Iterators:
  • Const Iterator
• Additional Features:
  • Template Hasher

Union Find

• Structure:
  • Union by Rank
  • Union by Size
• Additional Features:
• Path compression