Skip to content

Basic Data Structures πŸ“š contains simple and easy-to-understand implementations of fundamental data structures πŸ§‘β€πŸ’» like arrays πŸ“Š, linked lists πŸ”—, stacks πŸ“š, queues ⏳, and more. Perfect for beginners to learn and practice! πŸš€

Notifications You must be signed in to change notification settings

abdullahalsazib/Basic-Data-Structures

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 

History

4 Commits
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 

Repository files navigation

πŸ”₯ Basic Data Structures

πŸ“š Overview

A comprehensive collection of fundamental data structures implemented in C++. This repository serves as both a learning resource and reference for common data structure implementations.

🎯 Contents

  • πŸ“¦ Vector Implementation
  • πŸ“ Linked Lists
    • Singly Linked List
    • Doubly Linked List
  • πŸ“š Stack & Queue
    • Stack Operations
    • Queue Implementation
  • 🌳 Trees
    • Binary Tree Implementation
    • Binary Search Tree (BST)
    • Tree Operations
  • πŸ“Š Heap
    • Heap Implementation
    • STL Heap Operations

πŸ› οΈ Technologies Used

  • C++

πŸš€ Getting Started

  1. Clone the repository:
    git clone https://github.com/yourusername/basic-data-structures.git
  2. Navigate to the project directory:
    cd basic-data-structures
  3. Compile the code:
    g++ -std=c++11 main.cpp -o program
  4. Run the program:
    ./program

πŸ“ Prerequisites

  • C++ compiler (GCC recommended)
  • Basic understanding of C++ programming
  • Git installed on your system

πŸ“‚ Repository Structure

Basic-Data-Structures/
β”œβ”€β”€ Module 1-3 (Basics & Vector)
β”œβ”€β”€ Module 5-10 (Linked Lists)
β”œβ”€β”€ Module 13-15 (Stack & Queue)
β”œβ”€β”€ Module 17-19 (Binary Trees)
β”œβ”€β”€ Module 21 (BST)
└── Module 22-23 (Heap)

πŸŽ“ Learning Path

  1. Start with Vector basics
  2. Move to Linked List implementations
  3. Explore Stack and Queue
  4. Learn Tree structures
  5. Master Heap operations

πŸ’‘ Key Features

  • Clear, well-documented implementations
  • Practical examples for each data structure
  • Progressive learning approach
  • STL implementations
  • Problem-solving examples

🀝 Contributing

Contributions are welcome! Please feel free to submit a Pull Request.

πŸ“ License

This project is open source and available under the MIT License.

πŸ‘¨β€πŸ’» Author

⭐ Show Your Support

Give a star if this project helped you!

πŸ“ž Contact

For questions or feedback, please open an issue in the repository.


Made with ❀️ for Data Structure enthusiasts

About

Basic Data Structures πŸ“š contains simple and easy-to-understand implementations of fundamental data structures πŸ§‘β€πŸ’» like arrays πŸ“Š, linked lists πŸ”—, stacks πŸ“š, queues ⏳, and more. Perfect for beginners to learn and practice! πŸš€

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages