Vaibhav Shende Vaibhav Shende

Data Structures in C++ — From Scratch Implementation

Complete implementations of fundamental data structures (linked lists, AVL/Red-Black trees, heaps, graphs, hash tables) built from scratch with complexity analysis.

Software
Data Structures in C++ — From Scratch Implementation

Overview

Implementations of fundamental data structures from scratch in modern C++ without STL libraries.

Data Structures Implemented

Linear Structures

  • Arrays, Linked Lists, Stacks, Queues

Tree Structures

  • Binary Trees, BST, AVL Trees, Red-Black Trees, Heaps

Hash Structures

  • Hash Tables, collision resolution (chaining & open addressing)

Graph Structures

  • Adjacency List/Matrix, Weighted Graphs, DFS, BFS, Shortest Path

Features

  • Clear Implementation: Easy-to-understand code
  • Complexity Analysis: Time/space complexity documented
  • Visualization: Helper functions for structure visualization
  • Comprehensive Tests: Unit tests for all structures
  • Performance Optimized: Memory-efficient implementations

Technical Details

  • Language: Modern C++
  • Build: CMake
  • Testing: Comprehensive test suite
  • Documentation: Inline comments and API docs

Getting Started

git clone https://github.com/svaibhav101/dataStructureCPP.git
cd dataStructureCPP && mkdir build && cd build
cmake .. && make && make test

Learning Outcomes

  • Deep understanding of data structure internals
  • Complexity analysis and optimization
  • C++ memory management and design patterns
  • Algorithm comparison and selection criteria