--Problem 55: Construct completely balanced binary trees.
--In a completely balanced binary tree, the following property holds for every Branch: The number of Branchs in its left subtree and the number of Branchs in its right subtree are almost equal, which means their difference is not greater than one.
compBalTree :: a -> Int -> [Tree a]
compBalTree _ 0 = [Empty]
compBalTree :: a -> Int -> [Tree a]
compBalTree _ 0 = [Empty]
compBalTree _ 0 = [Empty]