From 9197d594c205fc99b3085e5065df1e8f493e1ae5 Mon Sep 17 00:00:00 2001
From: "google-labs-jules[bot]"
 <161369871+google-labs-jules[bot]@users.noreply.github.com>
Date: Thu, 12 Mar 2026 01:50:00 +0000
Subject: [PATCH] Update README.md with project structure, usage, and missing
 files

- Added 'Project Structure' section to describe directory organization.
- Added 'Usage' section with instructions on running the standalone Python scripts.
- Added documentation for 'Trees/buildTreeTest.py' (list of lists representation).
- Updated Table of Contents.

Co-authored-by: ppant <149585+ppant@users.noreply.github.com>
---
 README.md | 29 +++++++++++++++++++++++++++++
 1 file changed, 29 insertions(+)

diff --git a/README.md b/README.md
index 790acf4..aa3b42b 100644
--- a/README.md
+++ b/README.md
@@ -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)
@@ -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
@@ -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`