feat(datastructures, trees): add depth, height and degree

Author: BrianLusina

datastructures/trees/binary/node.py

@@ -18,6 +18,9 @@ def __init__(
         key: Optional[Any] = None,
         parent: Optional["BinaryTreeNode"] = None,
         nxt: Optional["BinaryTreeNode"] = None,
+        depth: Optional[int] = None,
+        height: Optional[int] = None,
+        degree: Optional[int] = None,
     ) -> None:
         """
         Constructor for BinaryTreeNode class. This will create a new node with the provided data and optional
@@ -35,7 +38,7 @@ def __init__(
             of the tree, then this is the next node on the next level starting from the left. If this is the last node
             in the tree, then this is None.
         """
-        super().__init__(data, key, parent)
+        super().__init__(data, key, parent, depth, height, degree)
         self.left: Optional[BinaryTreeNode] = left
         self.right: Optional[BinaryTreeNode] = right
         # Next is a pointer that connects this node to it's right sibling in the tree. If this node is the right most

datastructures/trees/node.py

@@ -13,7 +13,13 @@ class TreeNode(Generic[T]):
     """
 
     def __init__(
-        self, value: T, key: Optional[Any] = None, parent: Optional["TreeNode"] = None
+        self,
+        value: T,
+        key: Optional[Any] = None,
+        parent: Optional["TreeNode"] = None,
+        depth: Optional[int] = None,
+        height: Optional[int] = None,
+        degree: Optional[int] = None,
     ):
         """
         Initialises a tree node with a value, key and a parent node.
@@ -23,16 +29,22 @@ def __init__(
             value (T): The value of the node
             key (Optional[Any]): The key of the node. If not provided, a hash of the data is used.
             parent (Optional[TreeNode]): The parent node of the current node.
+            depth (int): The depth of the current node.
+            height (int): The height of the current node.
+            degree (int): The degree of the current node.
 
         Notes:
             The key is used to identify the node in the tree. If not key is provided, a hash of the data is used.
         """
         self.data = value
         self.key = key or hash(value)
         self.parent = parent
+        self.depth = depth
+        self.height = height
+        self.degree = degree
 
     def __repr__(self):
-        return f"TreeNode(data={self.data}, key={self.key})"
+        return f"TreeNode(data={self.data}, key={self.key}, depth={self.depth}, height={self.height}, degree={self.degree})"
 
     def __eq__(self, other: "TreeNode[T]") -> bool:
         """Checks if this node is equal to another node based on the data they contain