@all : Could anyone explain it using the tree diagram . @nithin : 4 may not be th answer i am not able to plot into a tree satisfying those constarints
On Thu, Aug 11, 2011 at 9:16 PM, Nitin Nizhawan <[email protected]>wrote: > i guess answer is c. 4 > > n*i+1 > > > On Thu, Aug 11, 2011 at 8:01 PM, rShetty <[email protected]> wrote: > >> A complete n- array tree in which each node has n children or no >> children, let i be the number of internal nodes and L be the number of >> leaves in a complete n- array tree. If L=41 and i=10 what is the value >> of n. >> >> a. 3 b. 6 c. 4 >> >> >> How to solve such problems?? >> >> -- >> 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. >> >> > -- > 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. > -- Regards Rajeev N B <http://www.opensourcemania.co.cc> "*Winners Don't do Different things , they do things Differently"* -- 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.
