Let me rephrase :)

Are there any specific theories on running up trees like that?

Mastering Algorithms with Perl discusses linked lists (single, double, circular), binary trees (B-Trees & plain binary trees), heaps (binary & janus). None of these structures are exactly what I need/have... It's kinda like a combination of a double linked list and a 2-3 tree (but without the balancing, sorting, limited nodes, etc).
The algorithm I described above works fine (altho I didn't stress test)... I'm just looking for a few pointers on how this could be more effective.
As for the Knuth note: I have it on my wishlist, doubt I'll get em before X-mas.

I got a flow online here, Dia XML is here

Greetz
Beatnik
... Quidquid perl dictum sit, altum viditur.