i need quick help in haskell. it's about trees (unlimited nodes per subtree, so no binary ones) which stores an int, and i need to get the highest value, its depth and the sum of all nodes.
i'll donate fg
pm me pls

This post was edited by The_Darkness_II on Nov 25 2014 07:42pm