From b6a1fb5b3d52b8283f3f6cbb3d5d44277c6a6ccf Mon Sep 17 00:00:00 2001
From: "google-labs-jules[bot]"
 <161369871+google-labs-jules[bot]@users.noreply.github.com>
Date: Mon, 16 Mar 2026 01:49:57 +0000
Subject: [PATCH] Update README.md with missing files, usage instructions, and
 license

- Added Trees/buildTreeTest.py to the Trees section.
- Added a Usage section with examples of how to run the scripts.
- Added a License section specifying the MIT License.
- Updated the Table of Contents to include the new sections.

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

diff --git a/README.md b/README.md
index 790acf4..76c14b4 100644
--- a/README.md
+++ b/README.md
@@ -13,6 +13,8 @@ This repository contains a collection of common programming problems and data st
 - [Sorting](#sorting)
 - [Graph Algorithms](#graph-algorithms)
 - [Error Handling](#error-handling)
+- [Usage](#usage)
+- [License](#license)
 - [Acknowledgments](#acknowledgments)
 
 ---
@@ -149,6 +151,10 @@ Implementing a tree using classes and references.
 Print a binary tree in level order.
 - **File**: `Trees/TreeLevelOrderPrintImple.py`
 
+### Tree Representation (List of Lists)
+Implementing a tree using a list of lists.
+- **File**: `Trees/buildTreeTest.py`
+
 ---
 
 ## Sorting
@@ -204,6 +210,25 @@ Demonstrates `try-except-else-finally` blocks and user input validation.
 
 ---
 
+## Usage
+
+Most scripts are standalone and can be executed using Python 3:
+```bash
+python3 path/to/script.py
+```
+For example:
+```bash
+python3 Arrays/ArrayPairSumSol.py
+```
+
+---
+
+## License
+
+This project is licensed under the MIT License.
+
+---
+
 ## Acknowledgments
 - [Python for Data Structures, Algorithms, and Interviews on Udemy](https://www.udemy.com)
 - [Problem Solving with Algorithms and Data Structures using Python](http://interactivepython.org/runestone/static/pythonds/index.html)