MCPcopy Index your code
hub / github.com/TheAlgorithms/Python / post_order

Function post_order

searches/binary_tree_traversal.py:86–105  ·  view source on GitHub ↗

>>> root = TreeNode(1) >>> tree_node2 = TreeNode(2) >>> tree_node3 = TreeNode(3) >>> tree_node4 = TreeNode(4) >>> tree_node5 = TreeNode(5) >>> tree_node6 = TreeNode(6) >>> tree_node7 = TreeNode(7) >>> root.left, root.right = tree_node2, tree_node3 >>> tree_node2.

(node: TreeNode)

Source from the content-addressed store, hash-verified

84
85
86def post_order(node: TreeNode) -> None:
87 """
88 >>> root = TreeNode(1)
89 >>> tree_node2 = TreeNode(2)
90 >>> tree_node3 = TreeNode(3)
91 >>> tree_node4 = TreeNode(4)
92 >>> tree_node5 = TreeNode(5)
93 >>> tree_node6 = TreeNode(6)
94 >>> tree_node7 = TreeNode(7)
95 >>> root.left, root.right = tree_node2, tree_node3
96 >>> tree_node2.left, tree_node2.right = tree_node4 , tree_node5
97 >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
98 >>> post_order(root)
99 4,5,2,6,7,3,1,
100 """
101 if not isinstance(node, TreeNode) or not node:
102 return
103 post_order(node.left)
104 post_order(node.right)
105 print(node.data, end=",")
106
107
108def level_order(node: TreeNode) -> None:

Callers 1

Calls

no outgoing calls

Tested by

no test coverage detected