Excatly.... why dont u just make a rough diagram in paper for binary and ternary trees
and just see that each level has max of 2/3^i where 2/3 is for binary/ternary tree and i is level where root level is 0... then make a complete ternary tree and see why leaves with 28 in numbers have internal nodes 40... just do it and then u will learn On Wed, Aug 10, 2011 at 4:58 PM, Brijesh Upadhyay < [email protected]> wrote: > It could have a maximum of 81 leaves with the same '40' no of internal > nodes.... so for any value between 28 to 81, it would have only 40 internal > nodes > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/hb7mifIIe1kJ. > > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- **Regards SAGAR PAREEK COMPUTER SCIENCE AND ENGINEERING NIT ALLAHABAD -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
