
Algebra PreAlgebra and Basic Algebra Math Forum 
 LinkBack  Thread Tools  Display Modes 
December 4th, 2012, 11:42 PM  #1 
Newbie Joined: Dec 2012 Posts: 1 Thanks: 0  Problem with binary tree
Hello. Given a binary tree in which the root number is 0 and each left node is the previous number plus one ( left = x + 1 ) and the right node is the previous number plus two ( right = x + 2 ), is it possible, somehow, to reconstruct this binary tree having only the last number, for instance, "4"? Example: 0 / \ 1 2 / \ / \ 2 3 3 "4" How to know that "4" is from: 2 / \ 3 "4" or from: 3 / \ "4" 5 Very thanks. 
December 5th, 2012, 12:22 AM  #2 
Math Team Joined: Apr 2010 Posts: 2,780 Thanks: 361  Re: Problem with binary tree
You can reconstruct it, but you can't tell which 4 it is unless you know, for example, if it's a left or a right node and the level it's on (look at 2).


Tags 
binary, problem, tree 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
random variable binary tree problem  frenchiehey  Algebra  1  November 21st, 2013 06:00 PM 
Discrete math tree problem claim?  Nerbu123  Computer Science  2  March 20th, 2012 08:25 AM 
how to solve this tree diagram problem  limengxi  Advanced Statistics  1  March 9th, 2011 12:49 AM 
Decision Tree  Is there a problem with this problem?  Bails  Algebra  0  March 4th, 2010 06:02 PM 
Discrete math tree problem claim?  Nerbu123  Applied Math  1  December 31st, 1969 04:00 PM 