in search top dpwn bottom up
what differnce do it make in between espially the outcome ?
thanks
.
|
|
| User: "Alf P. Steinbach" |
|
| Title: Re: >>>>> tree |
01 Aug 2007 09:14:10 PM |
|
|
* biglork150@yahoo.co.jp:
in search top dpwn bottom up
what differnce do it make in between espially the outcome ?
Hm. <url: http://redwing.hutman.net/%7Emreed/warriorshtm/garble.htm>.
Others, note the cross-posting to [comp.programming] + [comp.lang.c++].
--
A: Because it messes up the order in which people normally read text.
Q: Why is it such a bad thing?
A: Top-posting.
Q: What is the most annoying thing on usenet and in e-mail?
.
|
|
|
| User: "" |
|
| Title: Re: >>>>> tree |
02 Aug 2007 12:59:59 AM |
|
|
On Aug 2, 11:14 am, "Alf P. Steinbach" <al...@start.no> wrote:
* biglork...@yahoo.co.jp:
in search top dpwn bottom up
what differnce do it make in between espially the outcome ?
Hm. <url:http://redwing.hutman.net/%7Emreed/warriorshtm/garble.htm>.
Others, note the cross-posting to [comp.programming] + [comp.lang.c++].
--
A: Because it messes up the order in which people normally read text.
Q: Why is it such a bad thing?
A: Top-posting.
Q: What is the most annoying thing on usenet and in e-mail?
What is the answet to the problem ?
.
|
|
|
| User: "Barry" |
|
| Title: Re: >>>>> tree |
02 Aug 2007 01:05:55 AM |
|
|
What is the answet to the problem ?
I think you gave a off-topic post here,
So a off-topic answer was given
:-)
.
|
|
|
|
|
|
| User: "Thomas Matthews" |
|
| Title: Re: >>>>> tree |
03 Aug 2007 11:01:55 PM |
|
|
wrote:
in search top dpwn bottom up
what differnce do it make in between espially the outcome ?
thanks
Let the root node be the top of the tree.
Let a leaf node be a bottom location of the tree that has no more children.
Searching bottom up is more difficult because there are more leaf nodes
than root nodes. Most trees have only one root node.
Data ordering. Many trees, such as binary search trees, order their
nodes. Traversing a binary search tree from top to bottom cuts down
on search time.
Data structuring. Most trees have only links to the children. This
is fine when searching from top to bottom. However, searching from
bottom up requires links to the parents.
In C++, the std::map container is often implemented using a tree. One
nice point about the interface for std::map is that the user is not
concerned about _how_ the search is conducted, only its performance.
--
Thomas Matthews
C++ newsgroup welcome message:
http://www.slack.net/~shiva/welcome.txt
C++ Faq: http://www.parashift.com/c++-faq-lite
C Faq: http://www.eskimo.com/~scs/c-faq/top.html
alt.comp.lang.learn.c-c++ faq:
http://www.comeaucomputing.com/learn/faq/
Other sites:
http://www.josuttis.com -- C++ STL Library book
http://www.sgi.com/tech/stl -- Standard Template Library
.
|
|
|
|
|
Related Articles |
|
|
