@@ -1,2 +1,6 @@
data BinaryTree = Leaf | Node Integer BinaryTree BinaryTree
+height bigTree = case bigTree of
+ Leaf -> 0
+ Node _ leftTree rightTree -> 1 + max (height leftTree) (height rightTree)
+