Difference between revisions of "99 questions/Solutions/61"
< 99 questions | Solutions
Jump to navigation
Jump to search
m |
(categorize) |
||
| Line 8: | Line 8: | ||
countLeaves (Branch _ l r) = countLeaves l + countLeaves r |
countLeaves (Branch _ l r) = countLeaves l + countLeaves r |
||
</haskell> |
</haskell> |
||
| + | |||
| + | |||
| + | [[Category:Programming exercise spoilers]] |
||
Latest revision as of 13:38, 25 December 2016
Count the leaves of a binary tree
A leaf is a node with no successors. Write a predicate count_leaves/2 to count them.
countLeaves Empty = 0
countLeaves (Branch _ Empty Empty) = 1
countLeaves (Branch _ l r) = countLeaves l + countLeaves r