Function in_order

traversals/binary_tree_traversals.py:59–64 · view source on GitHub ↗

(node)

Source from the content-addressed store, hash-verified

57
58
59	def in_order(node):
60	if not isinstance(node, TreeNode) or not node:
61	return
62	in_order(node.left)
63	print(node.data, end=" ")
64	in_order(node.right)
65
66
67	def post_order(node):

binary_tree_traversals.pyFile · 0.85

no outgoing calls

no test coverage detected