createAndSumTree :: [Int] -> Int
createAndSumTree lst = hylo sum build lst where
  sum (LeafF v) = v
  sum (NodeF v0 v1) = v0 + v1
  build [val] = LeafF val
  build lst = NodeF l r
    where (l, r) = splitAt (length lst `div` 2) lst