data structure, Basic Computer Science

#question.a tree has 0 off springs at each node. if it had a label L, what will be the maximum number of nodes that the tree can have. only an expression involving the number of nodes and the level L is required.
Posted Date: 4/16/2012 1:20:08 PM | Location : United States







Related Discussions:- data structure, Assignment Help, Ask Question on data structure, Get Answer, Expert's Help, data structure Discussions

Write discussion on data structure
Your posts are moderated
Related Questions
Desktop computer: Desktop computer is popularly known as personal computer (PC). As the name suggest, it is generally small in size and fitted on the top of a desk which can b

main task of sofware developper

Algorithm : 1. Read the values of principal amount, time and rate of simple interest into the locations labelled as P, T, R. 2. Set the count T to 1 implying the end of a year. 3.

Device Drivers:   Device drivers are shared computer programs that provide an interface between the hardware devices and operating system or other higher level programs.

explian set associte mapping

Programming Languages A number of programming languages are available for program writing. These languages can be classified as follows:     Machine language     Assem

what is a dry running of flow chart?

Liquid Crystal Displays (LCD): First introduced in watches and clocks in the1970's, LCDs are now used to display images in monitors. A newer technology in computer screens is