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

Function pre_order

searches/binary_tree_traversal.py:42–61  ·  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

40
41
42def pre_order(node: TreeNode) -> None:
43 """
44 >>> root = TreeNode(1)
45 >>> tree_node2 = TreeNode(2)
46 >>> tree_node3 = TreeNode(3)
47 >>> tree_node4 = TreeNode(4)
48 >>> tree_node5 = TreeNode(5)
49 >>> tree_node6 = TreeNode(6)
50 >>> tree_node7 = TreeNode(7)
51 >>> root.left, root.right = tree_node2, tree_node3
52 >>> tree_node2.left, tree_node2.right = tree_node4 , tree_node5
53 >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
54 >>> pre_order(root)
55 1,2,4,5,3,6,7,
56 """
57 if not isinstance(node, TreeNode) or not node:
58 return
59 print(node.data, end=",")
60 pre_order(node.left)
61 pre_order(node.right)
62
63
64def in_order(node: TreeNode) -> None:

Callers 1

Calls

no outgoing calls

Tested by

no test coverage detected