Update tree.py

Author: Fiqqar

height_of_tree/tree.py

@@ -1,31 +1,18 @@
 class Node:
-    def __init__(self, info: int) -> None:
-        self.info: int = info
-        self.left: Node | None = None
-        self.right: Node | None = None
+    def __init__(self, info):
+        self.info = info
+        self.left = None
+        self.right = None
 
-    def __str__(self) -> str:
-        """
-        >>> str(Node(5))
-        '5'
-        """
+    def __str__(self):
         return str(self.info)
 
 
 class BinarySearchTree:
-    def __init__(self) -> None:
-        self.root: Node | None = None
+    def __init__(self):
+        self.root = None
 
-    def create(self, val: int) -> None:
-        """
-        >>> bst = BinarySearchTree()
-        >>> bst.create(10)
-        >>> bst.root.info
-        10
-        >>> bst.create(5)
-        >>> bst.root.left.info
-        5
-        """
+    def create(self, val):
         if self.root is None:
             self.root = Node(val)
         else:
@@ -47,51 +34,17 @@ def create(self, val: int) -> None:
                     break
 
 
-def height(node: Node | None) -> int:
-    """
-    >>> height(None)
-    -1
-    >>> n = Node(3)
-    >>> height(n)
-    0
-    >>> n.left = Node(2)
-    >>> n.right = Node(5)
-    >>> n.right.right = Node(6)
-    >>> height(n)
-    2
-    """
+def height(node):
     if node is None:
         return -1
     return 1 + max(height(node.left), height(node.right))
 
 
-def tree_height_from_list(data: list[int]) -> int:
-    """
-    >>> tree_height_from_list([3,2,5,6])
-    2
-    >>> tree_height_from_list([1])
-    0
-    >>> tree_height_from_list([5,1,10,15,7])
-    3
-    """
-    if not data:
-        return -1
-    nodes = [Node(val) for val in data]
-    q = [nodes[0]]
-    i = 1
-    front = 0
-    while i < len(nodes):
-        curr = q[front]
-        front += 1
-        if i < len(nodes):
-            curr.left = nodes[i]
-            q.append(curr.left)
-            i += 1
-        if i < len(nodes):
-            curr.right = nodes[i]
-            q.append(curr.right)
-            i += 1
-    return height(nodes[0])
+def tree_height_from_list(data):
+    bst = BinarySearchTree()
+    for x in data:
+        bst.create(x)
+    return height(bst.root)
 
 
 if __name__ == "__main__":