«

- with 10 nodes, give one example of an unbalanced binary tree and
one example of a balanced binary tree
- what is the advantage of having a balanced binary tree over an
unbalanced tree?
- number your nodes, then give the order in which nodes will be
visited by a depth-first-search
- explain the differences between traversing the tree pre-order, in-
order and post-order

schrieb:
> - with 10 nodes, give one example of an unbalanced binary tree and
> one example of a balanced binary tree
[more homework]

What is your C++ language question?

--
Thomas
http://www.netmeister.org/news/learn2quote.html

writes:

> - with 10 nodes, give one example of an unbalanced binary tree and
> one example of a balanced binary tree
> - what is the advantage of having a balanced binary tree over an
> unbalanced tree?
> - number your nodes, then give the order in which nodes will be
> visited by a depth-first-search
> - explain the differences between traversing the tree pre-order, in-
> order and post-order

- explain how you expect to learn C++ without doing your own homework

sherm--

--
Web Hosting by West Virginians, for West Virginians: http://wv-www.net
Cocoa programming in Perl: http://camelbones.sourceforge.net

wrote:

Don't

Multi-post on Usenet.
Post homework questions.


--
Ian Collins.

<> wrote in message
news: ups.com...
> - with 10 nodes, give one example of an unbalanced binary tree and
> one example of a balanced binary tree
> - what is the advantage of having a balanced binary tree over an
> unbalanced tree?
> - number your nodes, then give the order in which nodes will be
> visited by a depth-first-search
> - explain the differences between traversing the tree pre-order, in-
> order and post-order

You have the answer. It's in the textbook the teacher gave you/had you buy.
It's time to crack the seal, open it up and actually read it.