Computer Science, asked by anumathew061gmailcom, 2 months ago

what is the minimum possible depth of d array each node has atmost d children

Answers

Answered by Anonymous

The minimum possible depth of a d-ary tree is Ω (log n / log d) where n is the number of nodes in the tree and d is the maximum number of children a node can have. The height of the tree is equal to the maximum depth of the tree.

brainlist plz!

Previous Question

Next Question

Similar questions

Math, 1 month ago

x-5/2 - x-3/6 =3/2 solve the following equation.

History, 1 month ago

what is the full form of N.D.A and B.sc...

Social Sciences, 1 month ago

what is the meaning of Judaism...

Computer Science, 2 months ago

3. The touching color()? block is a part of the Control block menu...

English, 2 months ago

'Two or three times a week a customer came in, in whom she beganto take an interest'. Who did Miss Martha think the customer was and hat his financial condition was? On what basis did she make these deductions?

English, 8 months ago

Describe the town mouse in the ...

English, 8 months ago

Name the planet is nearest to the sun ?

Social Sciences, 8 months ago

we can make a globe for a small part of the earth...

what is the minimum possible depth of d array each node has atmost d children​

Answers

brainlist plz!

what is the minimum possible depth of d array each node has atmost d children