Average term size : Max-size : Evaluate reference : Generate for caseine :
type 'a tree = Empty | Node of 'a tree * 'a * 'a tree val sum: int list tree -> int let rec sum = function Empty -> 0 | Node (lhs,l,rhs) -> sum lhs + (List.fold_left (+) 0 l) + sum rhs