Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

(jeffa) Re: Data Structures wanted; apply within.

by jeffa (Bishop)
on Mar 09, 2001 at 07:03 UTC ( [id://63155]=note: print w/replies, xml ) Need Help??


in reply to Data Structures wanted; apply within.

Try to build a red-black tree sometime. I had to write mine in C++, if I still didn't have the shakes I'd try to write a Perl version.

UPDATE: Hey! No peeking! But it is interesting that it uses the algorithm from "The White Book" . . .

Jeff

can't sleep . . . red black tree'll eat me

  • Comment on (jeffa) Re: Data Structures wanted; apply within.

Replies are listed 'Best First'.
Re: Data Structures wanted; apply within.
by Falkkin (Chaplain) on Mar 09, 2001 at 08:52 UTC
    There is already a Tree::RedBlack module, as I (indirectly) mentioned in my post above; on the other hand, maybe I should implement my own Red-Black tree for purposes of self-amusement(?)....

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://63155]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others imbibing at the Monastery: (3)
As of 2024-04-24 20:22 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found