Function pre_order

traversals/binary_tree_traversals.py:51–56 · view source on GitHub ↗

(node)

Source from the content-addressed store, hash-verified

49
50
51	def pre_order(node):
52	if not isinstance(node, TreeNode) or not node:
53	return
54	print(node.data, end=" ")
55	pre_order(node.left)
56	pre_order(node.right)
57
58
59	def in_order(node):

binary_tree_traversals.pyFile · 0.85

no outgoing calls

no test coverage detected