in ques 1 i considered leaves as nodes... if we consider only internal nodes then it have 27
On Wed, Aug 10, 2011 at 1:12 AM, sagar pareek <sagarpar...@gmail.com> wrote: > 1. 28+27 > 2. 2pow(d) > > > On Wed, Aug 10, 2011 at 12:07 AM, NIKHIL > <nikhil.jain.shali...@gmail.com>wrote: > >> In a ternary Tree No of leaves 28. How many nodes it have? >> An AVL tree with height d. How many children it have? >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algogeeks@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > **Regards > SAGAR PAREEK > COMPUTER SCIENCE AND ENGINEERING > NIT ALLAHABAD > > -- **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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
