procedure postorder (T : ordered root tree)
r := root of T 
for each child c of r from left to right
begin 
	T(c) := subtree with c as its root
	postorder (T(c)) 
end
list r