Mark Phippard <markp...@gmail.com> writes: > * Delete and move are slower than I would have expected.
These are slow because delete has no recursive optimisation. Non-recursive delete of a node with all children already deleted is the most basic operation, and recursive delete can be implemented in terms of this operation. That's what we have, since we only need to implement the one fundamental operation. However it would be more efficient to implement some recursive delete optimisations. -- Philip
