Skip to content
Open
Changes from all commits
Commits
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
23 changes: 23 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -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)

---
Expand Down Expand Up @@ -145,6 +147,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 the list of lists approach.
- **File**: `Trees/buildTreeTest.py`

### Tree Level Order Print
Print a binary tree in level order.
- **File**: `Trees/TreeLevelOrderPrintImple.py`
Expand Down Expand Up @@ -204,6 +210,23 @@ Demonstrates `try-except-else-finally` blocks and user input validation.

---

## Usage

Most scripts in this repository are standalone and can be executed directly using the Python 3 interpreter. They typically include their own test cases or verification logic at the bottom of the file.

Example:
```bash
python3 Arrays/Anagram_Check_Sorted_Sol.py
```

---

## License

This project is licensed under the MIT License. See the `LICENSE` file for details (if available).

---

## 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)
Expand Down