From 3d2c76ecabca618ca39126685c9212581d2aea2e Mon Sep 17 00:00:00 2001
From: "google-labs-jules[bot]"
 <161369871+google-labs-jules[bot]@users.noreply.github.com>
Date: Tue, 10 Mar 2026 02:05:17 +0000
Subject: [PATCH] Update README.md with prerequisites, usage instructions, and
 missing tree documentation

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

diff --git a/README.md b/README.md
index 790acf4..df14ade 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
+- [Prerequisites](#prerequisites)
+- [How to Use](#how-to-use)
 - [Arrays](#arrays)
 - [Linked Lists](#linked-lists)
 - [Stacks](#stacks)
@@ -17,6 +19,28 @@ This repository contains a collection of common programming problems and data st
 
 ---
 
+## Prerequisites
+
+- **Python 3.x**: Ensure you have Python 3 installed on your system. You can check your version by running `python --version` or `python3 --version`.
+
+---
+
+## How to Use
+
+All scripts in this repository are standalone and can be executed directly using the Python interpreter.
+
+1.  Clone the repository:
+    ```bash
+    git clone https://github.com/your-username/repository-name.git
+    cd repository-name
+    ```
+2.  Run a specific script:
+    ```bash
+    python Arrays/Anagram_Check_Sorted_Sol.py
+    ```
+
+---
+
 ## Arrays
 
 ### Anagram Check
@@ -145,6 +169,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`