UserFriendly Strip Comments


	The Daily Static UF Archives Register UF Membership Ad Free Site Postcards Community Geekfinder UFie Gear Advertise on UF Forum Rules & FAQ Username Password Create a New Account

Back to UserFriendly Strip Comments Index

Binary trees, non-unique values	by mikosullivan	2002-06-12 05:04:11
Have you looked at the GLib implementation?	by decadence	2002-06-12 07:11:44
...source for which is downloadable from www.gtk.org. I've never had occasion to use binary trees myself, but I did have occasion to use hash tables, and the GLib hash table implementation is very nice and totally out-performed everything I slapped together myself. Anyway, I'm inclined to think that their implementation of "Balanced Binary Trees" is probably similarly nice, too. At the very least you could pick thru their code for the bits you're having difficulty with. Just my $0.02 - currently worth not a whole lot given prevailing economic conditions. ;)
[ Reply ]

[Todays Cartoon Discussion] [News Index]

Come get yer ARS (Account Registration System) Source Code here!
All images, characters, content and text are copyrighted and trademarks of J.D. Frazer except where other ownership applies. Don't do bad things, we have lawyers.
UserFriendly.Org and its operators are not liable for comments or content posted by its visitors, and will cheerfully assist the lawful authorities in hunting down script-kiddies, spammers and other net scum. And if you're really bad, we'll call your mom. (We're not kidding, we've done it before.)