09/07/21 16:58:18
>>523
-- Haskell
data BTree a = Node (BTree a) a (BTree a) | Nil
size :: BTree a -> Int
size Nil = 0
size (Node tl _ tr) = 1 + (size tl) + (size tr)
main = print $ size node
where
node = Node (Node (Node Nil 2 Nil) 4 Nil) 0 (Node Nil 2 Nil)