99 questions/Solutions/61

From HaskellWiki
< 99 questions‎ | Solutions
Revision as of 13:38, 25 December 2016 by Wizzup (talk | contribs) (categorize)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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