MCPcopy Create free account
hub / github.com/TheAlgorithms/Python / preorder

Function preorder

data_structures/binary_tree/binary_tree_traversals.py:33–43  ·  view source on GitHub ↗

Pre-order traversal visits root node, left subtree, right subtree. >>> list(preorder(make_tree())) [1, 2, 4, 5, 3]

(root: Node | None)

Source from the content-addressed store, hash-verified

31
32
33def preorder(root: Node | None) -> Generator[int]:
34 """
35 Pre-order traversal visits root node, left subtree, right subtree.
36 >>> list(preorder(make_tree()))
37 [1, 2, 4, 5, 3]
38 """
39 if not root:
40 return
41 yield root.data
42 yield from preorder(root.left)
43 yield from preorder(root.right)
44
45
46def postorder(root: Node | None) -> Generator[int]:

Callers 1

mainFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected