in reply to Growing exotic trees

You bet there are. You will need to do some research to find them. I was going to quote some for you from my Knuth book but decided that would be a bit much.

I would also suggest looking around in your nearest Barnes & Noble or other favorite books store for a copy of (I think this is the title) Algorithms in Perl or Perl 5 How-To.

Peter L. BergholdSchooner Technology Consulting, Inc.
Peter@Berghold.Netwww.berghold.net

Replies are listed 'Best First'.
Re: Re: Growing exotic trees
by Beatnik (Parson) on May 27, 2001 at 15:26 UTC
    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.
[reply]

In Section Seekers of Perl Wisdom