There is a need to find the height of a binary tree. Meaning beginning from root (0), the maximum hopes to "highest" leaf. Having the definition: data Tree a = Node a (Tree a) (Tree a) | Empty showing a Tree could be a node with two (node or empty ) or
Διαβάστε περισσότερα