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

[Michal Kawalec]

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

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 555 bytes
Desc: OpenPGP digital signature
URL: <http://www.haskell.org/pipermail/beginners/attachments/20140510/67ad5457/attachment.sig>