Data Structures and Algorithms

This repository is designed to provide clear and well-explained implementations of various data structures in Python.

Folder Structure

• LinkedList

  • Intro Linked List
  • Doubly Linked List
  • Advance Linked List
  • Sorting Algorithms with Linked List
  • Python Implementation of Linked List

• Stack

  • Intro Stack
  • Various Types of Stack
  • Sorting Algorithms with Stack
  • Python Implementation of Stack

• Queue

  • Intro Queue
  • Various Types of Queue
  • Sorting Algorithms with Queue
  • Python Implementation of Queue

• BinaryTree

  • Intro Binary Tree
  • Sorting Algorithms with Binary Tree
  • Python Implementation of Binary Tree

• BinarySearchTree

  • Intro Binary Search Tree
  • Sorting Algorithms with Binary Search Tree
  • Python Implementation of Binary Search Tree

Usage

• Prerequisites: You'll need a basic understanding of Python programming. Familiarity with data structures will be beneficial.

• Getting Started:

  1. Clone this repository to your local machine:

     git clone https://github.com/satishjhanwer/deep-dive-dsa.git

  2. Navigate to the folder

     cd deep-dive-dsa
     code .

  3. Open the files in a suitable Python IDE or code editor.

  4. Run the linked-list.py file or explore individual operations within it to see the linked list implementation in action.

• Learning:

  • Refer to the documentation files (.md files) for detailed explanations and examples.
  • Run the Python code and experiment with different functionalities.

Future Plans

We are actively working on extending this repository to include implementations of additional data structures, such as:

• Arrays
• Advance Tree
• Heap
• Graphs
• Hashing

Feel free to check back for updates or contribute your own implementations to make this a comprehensive data structures resource.