From efa1b7120882ac938bea57dabd31f77a0e20e0ea Mon Sep 17 00:00:00 2001
From: Hitesh Malhotra <68507331+CodeWithHitesh@users.noreply.github.com>
Date: Tue, 15 Jul 2025 00:15:33 +0530
Subject: [PATCH] refactor: move tests and update instructions

---
 README.md                            | 10 +++++++++-
 main.py                              | 28 ----------------------------
 tests/__init__.py                    |  0
 test_btree.py => tests/test_btree.py |  0
 4 files changed, 9 insertions(+), 29 deletions(-)
 delete mode 100644 main.py
 create mode 100644 tests/__init__.py
 rename test_btree.py => tests/test_btree.py (100%)

diff --git a/README.md b/README.md
index acfdeb3..b6ac2fc 100644
--- a/README.md
+++ b/README.md
@@ -43,10 +43,18 @@ btree.traverse()
 print()
 ```
 
+## Demo
+
+Run the example script to see a B-Tree in action:
+
+```sh
+python examples/demo.py
+```
+
 ## Run Tests
 
 ```sh
-python -m unittest test_btree.py
+python -m unittest discover
 ```
 
 ## Test Coverage
diff --git a/main.py b/main.py
deleted file mode 100644
index 98a7a85..0000000
--- a/main.py
+++ /dev/null
@@ -1,28 +0,0 @@
-from btree import BTree
-
-
-def demo() -> None:
-    t = BTree(3)
-    print("=== B-Tree Demo ===\n")
-
-    print("Inserting keys: 10, 20, 5, 6, 12, 30, 7, 17")
-    for key in [10, 20, 5, 6, 12, 30, 7, 17]:
-        t.insert(key)
-
-    print("\nTraversal of the constructed tree:")
-    t.traverse()
-    print("\n")
-
-    for k_to_find in [6, 15]:
-        result = "Present" if t.search(k_to_find) else "Not Present"
-        print(f"Search for {k_to_find}: {result}")
-
-    print("\nDeleting key 6...")
-    t.delete(6)
-    print("Traversal after deletion:")
-    t.traverse()
-    print()
-
-
-if __name__ == '__main__':
-    demo()
diff --git a/tests/__init__.py b/tests/__init__.py
new file mode 100644
index 0000000..e69de29
diff --git a/test_btree.py b/tests/test_btree.py
similarity index 100%
rename from test_btree.py
rename to tests/test_btree.py