feat: add testcase of binary_tree_travarsal

Author: zeelrupapara

searches/binary_tree_traversal.py

@@ -53,6 +53,11 @@ def pre_order(node: TreeNode) -> None:
     >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
     >>> pre_order(root)
     1,2,4,5,3,6,7,
+    >>> tree_node = TreeNode(42) # single node
+    >>> pre_order(tree_node)
+    42,
+    >>> tree_node = None
+    >>> pre_order(tree_node)
     """
     if not isinstance(node, TreeNode) or not node:
         return
@@ -75,6 +80,8 @@ def in_order(node: TreeNode) -> None:
     >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
     >>> in_order(root)
     4,2,5,1,6,3,7,
+    >>> tree_node = None
+    >>> in_order(tree_node)
     """
     if not isinstance(node, TreeNode) or not node:
         return
@@ -97,6 +104,8 @@ def post_order(node: TreeNode) -> None:
     >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
     >>> post_order(root)
     4,5,2,6,7,3,1,
+    >>> tree_node = None
+    >>> post_order(tree_node)
     """
     if not isinstance(node, TreeNode) or not node:
         return
@@ -119,6 +128,8 @@ def level_order(node: TreeNode) -> None:
     >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
     >>> level_order(root)
     1,2,3,4,5,6,7,
+    >>> tree_node = None
+    >>> level_order(tree_node)
     """
     if not isinstance(node, TreeNode) or not node:
         return
@@ -149,6 +160,8 @@ def level_order_actual(node: TreeNode) -> None:
     1,
     2,3,
     4,5,6,7,
+    >>> tree_node = None
+    >>> level_order_actual(tree_node)
     """
     if not isinstance(node, TreeNode) or not node:
         return
@@ -183,6 +196,8 @@ def pre_order_iter(node: TreeNode) -> None:
     >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
     >>> pre_order_iter(root)
     1,2,4,5,3,6,7,
+    >>> tree_node = None
+    >>> pre_order_iter(tree_node)
     """
     if not isinstance(node, TreeNode) or not node:
         return
@@ -213,6 +228,8 @@ def in_order_iter(node: TreeNode) -> None:
     >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
     >>> in_order_iter(root)
     4,2,5,1,6,3,7,
+    >>> tree_node = None
+    >>> in_order_iter(tree_node)
     """
     if not isinstance(node, TreeNode) or not node:
         return
@@ -241,6 +258,8 @@ def post_order_iter(node: TreeNode) -> None:
     >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
     >>> post_order_iter(root)
     4,5,2,6,7,3,1,
+    >>> tree_node = None
+    >>> post_order_iter(tree_node)
     """
     if not isinstance(node, TreeNode) or not node:
         return
@@ -259,6 +278,24 @@ def post_order_iter(node: TreeNode) -> None:
 
 
 def prompt(s: str = "", width=50, char="*") -> str:
+    """
+    >>> prompt()
+    '\\n**************************************************'
+    >>> prompt("Test")
+    '********************** Test **********************'
+    >>> prompt("Short", 40)
+    '**************** Short *****************'
+    >>> prompt("Longer Example", 30)
+    '******* Longer Example *******'
+    >>> prompt("", 10)
+    '\\n**********'
+    >>> prompt("Edge Case", 15)
+    '** Edge Case **'
+    >>> prompt("Custom Char", 20, "#")
+    '### Custom Char ####'
+    >>> prompt("ExactFit", 20)
+    '***** ExactFit *****'
+    """
     if not s:
         return "\n" + width * char
     left, extra = divmod(width - len(s) - 2, 2)