Quoting Martin Simmons <[EMAIL PROTECTED]>: > >>>>> On Wed, 07 Dec 2005 17:06:19 -0500, Ryan Novosielski <[EMAIL > >>>>> PROTECTED]> said: > > Ryan> I don't really understand the description of the red/black binary > Ryan> tree... I'd appreciate it if you could just explain this a little > better > Ryan> (if you're not too busy, it's clearly not urgent). > > It's just a way of storing values so they can be retrieved again efficiently. > The classic binary tree doesn't guarantee "efficiently" in all cases. > > Goggle finds lots of references to it. >
Red/black trees are the data structure used by C++ STL maps (associative containers). Any recent data structure text will cover it. IIRC, they are a way to store B-trees in fixed size nodes. HTH, Jeffrey ------------------------------------------------------- This SF.net email is sponsored by: Splunk Inc. Do you grep through log files for problems? Stop! Download the new AJAX search engine that makes searching your log files as easy as surfing the web. DOWNLOAD SPLUNK! http://ads.osdn.com/?ad_id=7637&alloc_id=16865&op=click _______________________________________________ Bacula-users mailing list Bacula-users@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/bacula-users
