Velocity Reviews - Computer Hardware Reviews

Velocity Reviews > Newsgroups > Programming > C++ > Binary trees

Reply
Thread Tools

Binary trees

 
 
n.noumia@gmail.com
Guest
Posts: n/a
 
      05-03-2007
- 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

 
Reply With Quote
 
 
 
 
Thomas J. Gritzan
Guest
Posts: n/a
 
      05-04-2007
http://www.velocityreviews.com/forums/(E-Mail Removed) 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
 
Reply With Quote
 
 
 
 
Sherm Pendley
Guest
Posts: n/a
 
      05-04-2007
(E-Mail Removed) 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
 
Reply With Quote
 
Ian Collins
Guest
Posts: n/a
 
      05-04-2007
(E-Mail Removed) wrote:

Don't

Multi-post on Usenet.
Post homework questions.


--
Ian Collins.
 
Reply With Quote
 
Jim Langston
Guest
Posts: n/a
 
      05-05-2007
<(E-Mail Removed)> wrote in message
news:(E-Mail Removed) 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.


 
Reply With Quote
 
 
 
Reply

Thread Tools

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are On
Pingbacks are On
Refbacks are Off


Similar Threads
Thread Thread Starter Forum Replies Last Post
Binary search trees (AVL trees) jacob navia C Programming 34 01-08-2010 07:27 PM
Binary Trees jova Java 11 04-26-2004 06:41 AM
Binary Trees jova C++ 11 04-26-2004 06:41 AM
Binary trees JC C++ 6 12-10-2003 04:30 PM
Non-Binary Trees Will Oram C++ 3 10-28-2003 01:01 PM



Advertisments