Re: [Haskell-beginners] Learning Haskell with the help of trees

On 10.05.2014 16:27, Bob Ippolito wrote:

In order to implement delete you need to have some sort of merge operation for the cases where the node being deleted has more than one child. In this case your tree data structure doesn't appear to be a search tree or balanced in any way so it's much harder to generally decide how delete should work.

But this is a binary (albeit unbalanced, which changes nothing) tree :) Michal