vollständige (!) binäre Bäume
data (,) a b = ( a, b ) -- geordnete Paare data Tree a = Leaf a | Branch (Tree (a,a)) x :: Tree Int x = Branch (Branch (Leaf ...