Re: red black trees
Re: red black trees
- Subject: Re: red black trees
- From: Todd Blanchard <email@hidden>
- Date: Wed, 18 Feb 2004 20:41:49 -0700
Well, for one thing I never need a binary or red-black tree collection.
At least that's now how I think of it.
I need collections that are either ordered, unordered, and perhaps
keyed by position or identifier. They might require fast append, fast
arbitrary insert, or fast lookup. These are the requirements based on
usage patterns. How I fulfill the requirements is implementation
detail and depending on insert frequency, can generally do as well with
a sorted array as a tree.
So what is driving your desire to have a tree vs an ordered array?
On Feb 18, 2004, at 9:35 AM, Brian Reardon wrote:
I have always been a little surprised that Apple does not have binary
or red-black tree collection classes in their cocoa or foundation
frameworks. Am I missing something? What do all of you use when you
need a tree type collection class?
Thanks.
-Brian
--
_______________________________________________
cocoa-dev mailing list | email@hidden
Help/Unsubscribe/Archives:
http://www.lists.apple.com/mailman/listinfo/cocoa-dev
Do not post admin requests to the list. They will be ignored.
_______________________________________________
cocoa-dev mailing list | email@hidden
Help/Unsubscribe/Archives:
http://www.lists.apple.com/mailman/listinfo/cocoa-dev
Do not post admin requests to the list. They will be ignored.