Binary trees

Discussion in 'C++' started by n.noumia@gmail.com, May 4, 2007.

  1. Guest

    - 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
     
    , May 4, 2007
    #1
    1. Advertising

  2. Thomas J. Gritzan, May 4, 2007
    #2
    1. Advertising

  3. 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
     
    Sherm Pendley, May 4, 2007
    #3
  4. Ian Collins Guest

    wrote:

    Don't

    Multi-post on Usenet.
    Post homework questions.


    --
    Ian Collins.
     
    Ian Collins, May 4, 2007
    #4
  5. Jim Langston Guest

    <> wrote in message
    news:...
    > - 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.
     
    Jim Langston, May 5, 2007
    #5
    1. Advertising

Want to reply to this thread or ask your own question?

It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
Similar Threads
  1. jova

    Binary Trees

    jova, Apr 25, 2004, in forum: Java
    Replies:
    11
    Views:
    775
    Roedy Green
    Apr 26, 2004
  2. Will Oram

    Non-Binary Trees

    Will Oram, Oct 27, 2003, in forum: C++
    Replies:
    3
    Views:
    739
    Stewart Gordon
    Oct 28, 2003
  3. JC

    Binary trees

    JC, Dec 8, 2003, in forum: C++
    Replies:
    6
    Views:
    622
    osmium
    Dec 10, 2003
  4. jova

    Binary Trees

    jova, Apr 25, 2004, in forum: C++
    Replies:
    11
    Views:
    811
    Roedy Green
    Apr 26, 2004
  5. jacob navia

    Binary search trees (AVL trees)

    jacob navia, Jan 3, 2010, in forum: C Programming
    Replies:
    34
    Views:
    1,495
    Dann Corbit
    Jan 8, 2010
Loading...

Share This Page