Hi,
Heikki Linnakangas wrote:
> AFAICT it's roughly the same data structure as the zipper tree you
> envisioned, but not implemented with separate executor nodes for each
> level.
Aha, that sounds good to me. ;-)
As I've already mentioned, I think it's even better to simply show the
user a single append node, instead of lots of small nodes from a binary
tree merger.
Regards
Markus
