|
-
January 20th, 2004, 02:30 PM
#1
Is it wrong to say that a binary tree does not require a separate sort?
In Printing the array elements in order without sorting???? the issue of whether a binary tree, such as what std::map usually uses, is considered a sort is discussed. It is a minor issue; I consider it to be insignificant. However I think that someone else is insisting that only one definition is valid. I think my definition is clear and I don't see why it is necessary to be so particular on this subject.
So when discussing a binary tree, such as what std::map usually uses, am I wrong for saying what I said? Note that I am willing to agree to have a different definition from others, but others are insisting that my definition is unacceptable.
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|