type 'a tree = Empty | Node of 'a tree * 'a * 'a tree val sum: (int -> int -> nat) -> int list tree -> int let rec sum f = function Empty -> 0 | Node (lhs,l,rhs) -> sum f lhs + (List.fold_left f 0 l) + sum f rhs