Results 1 to 2 of 2

Math Help - graph theory proof

  1. #1
    Junior Member
    Joined
    Jan 2009
    Posts
    32

    graph theory proof

    A binary tree of height h is called a complete binary tree if it is either empty, or it has two complete subtrees both of height h-1. Prove by induction on n greater than or equal to 0, that a complete binary tree with height n has 2^(n-1) total nodes
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member roninpro's Avatar
    Joined
    Nov 2009
    Posts
    485
    Are you sure the statement of your problem is correct?

    When n=1, your tree has three nodes, which contradicts the formula you have given.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Graph Theory Proof
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: April 4th 2011, 12:16 AM
  2. graph theory proof
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: May 20th 2010, 02:27 AM
  3. graph theory proof
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: April 5th 2010, 08:34 AM
  4. Graph theory: proof
    Posted in the Discrete Math Forum
    Replies: 7
    Last Post: October 29th 2009, 12:00 PM
  5. Graph Theory Proof please:-
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: October 18th 2008, 03:06 PM

Search Tags


/mathhelpforum @mathhelpforum