Skip to content

Update repository README documentation #4

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
ppant wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update repository README documentation #4

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
29 changes: 29 additions & 0 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,6 +3,8 @@
This repository contains a collection of common programming problems and data structure implementations in Python.

## Table of Contents
- [Project Structure](#project-structure)
- [Usage](#usage)
- [Arrays](#arrays)
- [Linked Lists](#linked-lists)
- [Stacks](#stacks)
Expand All @@ -17,6 +19,29 @@ This repository contains a collection of common programming problems and data st

---

## Project Structure
The repository is organized into the following directories:
- `Arrays/`: Array-based problems and algorithms.
- `Error-debug/`: Examples of error handling and debugging in Python.
- `GraphAlgorithms/`: Implementations of graph data structures and algorithms (BFS, DFS, etc.).
- `LinkedLists/`: Singly and doubly linked list implementations and problems.
- `Queues/`: Queue implementations, including a queue using two stacks.
- `Recursion/`: Various problems solved using recursion.
- `Sorting/`: Common sorting algorithms (Bubble, Selection, Insertion, Merge, Quick, Shell).
- `Stacks/`: Stack implementation and related problems.
- `Trees/`: Binary trees, BST, Binary Heaps, and related algorithms.
- `deque/`: Double-ended queue implementation.

---

## Usage
Most scripts in this repository are standalone and can be executed directly using Python 3. For example:
```bash
python3 LinkedLists/SinglyLinkedListCycleCheckImple.py
```

---

## Arrays

### Anagram Check
Expand Down Expand Up @@ -145,6 +170,10 @@ Trim a BST so all nodes are within a given range `[min, max]`.
Implementing a tree using classes and references.
- **File**: `Trees/TreeRepresentationWithNodesReferences.py`

### Tree Representation (List of Lists)
Implementing a tree using a list of lists.
- **File**: `Trees/buildTreeTest.py`

### Tree Level Order Print
Print a binary tree in level order.
- **File**: `Trees/TreeLevelOrderPrintImple.py`
Expand Down