Skip to content

feat: add test case of binary_tree_travarsal #11825

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

feat: add test case of binary_tree_travarsal #11825

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
944898d
feat: add testcase of binary_tree_travarsal
zeelrupapara Oct 6, 2024
ef065cd
fix: remove the single tree node test case from pre_order
zeelrupapara Oct 7, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
34 changes: 34 additions & 0 deletions searches/binary_tree_traversal.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -53,6 +53,8 @@ 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 = None
>>> pre_order(tree_node)
"""
if not isinstance(node, TreeNode) or not node:
return
Expand All @@ -75,6 +77,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
Expand All @@ -97,6 +101,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
Expand All @@ -119,6 +125,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
Expand Down Expand Up @@ -149,6 +157,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
Expand Down Expand Up @@ -183,6 +193,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
Expand Down Expand Up @@ -213,6 +225,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
Expand Down Expand Up @@ -241,6 +255,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
Expand All @@ -259,6 +275,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)
Expand Down