recursive_yield.py

class Node:
	def __init__(self, val, left, right):
		self.val = val
		self.left = left
		self.right = right


t = Node(3,
	Node(2,
		Node(1,None,None),
		Node(2.5, None, None),
	),
	Node(4,
		Node(3.5, None, None),
		Node(5,None,None),
	)
)

def inorder(n):
	if n is None:
		return
	yield from inorder(n.left)
	yield n.val
	yield from inorder(n.right)


for v in inorder(t):
	print(v)