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
A couple of possibilities...	by Tomcat	2002-06-12 05:51:20
Traversing entire tree	by mikosullivan	2002-06-12 06:15:50
Not necessarily	by ninewands	2002-06-12 08:16:10
hash tables	by mikosullivan	2002-06-12 09:18:47
couldn't each	by tigermouse	2002-06-12 09:45:44
record be the head node of a linked list or some such? Hash tables aren't ordered structures, like a trees are, and are usually used with non-duped data sets. Why do you have a db with multiple identical records? Do you need the data to be stored in an ordered fashion? Why not a b-tree insteand of a binary?
[ 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.)