New folder structure

src/datastructpy/__init__.py

@@ -1,3 +1,14 @@
 # read version from installed package
 from importlib.metadata import version
-__version__ = version("datastructpy")
+__version__ = version("datastructpy")
+
+# Import key submodules or classes for easy access
+from .node import Node
+from .non_linear.trees.binary_search_trees import BinarySearchTree
+
+# Define the public API of the package
+__all__ = [
+    "__version__",
+    "Node",
+    "BinarySearchTree",
+]

src/datastructpy/node.py

@@ -0,0 +1,17 @@
+class Node:
+    """
+    A class representing a node in a binary search tree (BST).
+
+    Attributes
+    ----------
+    key : int
+        The value stored in the node.
+    left : Node, optional
+        The left child node (default is None).
+    right : Node, optional
+        The right child node (default is None).
+    """
+    def __init__(self, key):
+        self.key = key
+        self.left = None
+        self.right = None

src/datastructpy/datastructpy.py → src/datastructpy/non-linear/trees/binary_search_tree.py

@@ -1,21 +1,3 @@
-class Node:
-    """
-    A class representing a node in a binary search tree (BST).
-
-    Attributes
-    ----------
-    key : int
-        The value stored in the node.
-    left : Node, optional
-        The left child node (default is None).
-    right : Node, optional
-        The right child node (default is None).
-    """
-    def __init__(self, key):
-        self.key = key
-        self.left = None
-        self.right = None
-
 class BinarySearchTree:
     """
     A class representing a binary search tree (BST).
@@ -163,4 +145,3 @@ def list_to_tree(elements):
         print(bst.root.left.key)  # Output: 5 (left child of root)
         print(bst.root.right.key) # Output: 15 (right child of root)
         """
-

tests/non-linear/trees/binary_search_tree/test_delete.py

@@ -0,0 +1,2 @@
+from datastructpy.non_linear.trees.binary_search_trees import BinarySearchTree
+

tests/non-linear/trees/binary_search_tree/test_insert.py

@@ -0,0 +1 @@
+from datastructpy.non_linear.trees.binary_search_trees import BinarySearchTree

tests/non-linear/trees/binary_search_tree/test_list_to_tree.py

@@ -0,0 +1 @@
+from datastructpy.non_linear.trees.binary_search_trees import BinarySearchTree

tests/non-linear/trees/binary_search_tree/test_search.py

@@ -0,0 +1 @@
+from datastructpy.non_linear.trees.binary_search_trees import BinarySearchTree

tests/test_datastructpy.py

@@ -1 +1,3 @@
 from datastructpy import datastructpy
+
+# To do: Delete file later