procedure  inorder (T := ordered root tree)
r := root of T 
if r is a leaf then list r
else 
	begin
		l := first child of r from left to right 
		T(l) := subtree with l as its root
	              inorder (T(l))
		list r 
		for eadh child c of r except for l from left to right
			T(c) := subtree with c as its root
			inorder (T(c))
  	end