MCPcopy Create free account
hub / github.com/subbarayudu-j/TheAlgorithms-Python / in_order_iter

Function in_order_iter

traversals/binary_tree_traversals.py:125–136  ·  view source on GitHub ↗
(node)

Source from the content-addressed store, hash-verified

123
124
125def in_order_iter(node):
126 if not isinstance(node, TreeNode) or not node:
127 return
128 stack = []
129 n = node
130 while n or stack:
131 while n:
132 stack.append(n)
133 n = n.left
134 n = stack.pop()
135 print(n.data, end=" ")
136 n = n.right
137
138
139def post_order_iter(node):

Callers 1

Calls 1

popMethod · 0.45

Tested by

no test coverage detected