Computer Science, asked by anumathew061gmailcom, 4 months ago

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

Answers

Answered by Anonymous
0

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
Science, 2 months ago
Plastics are very useful, yet their use is discouraged. Why? Explain with the help of examples.​
Social Sciences, 2 months ago
Name the actual resource which was not considered a resource before, but after the technology developed, people realised its importance.​
Math, 2 months ago
a Robin had Rs 6oo. He gave RS 130 ta his friend and Rs 230 to his sister How Much money is Rabin left with ? solve without bar model. ​
Computer Science, 4 months ago
3. The touching color()? block is a part of the Control block menu​...
English, 4 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, 10 months ago
Describe the town mouse in the ​...
English, 10 months ago
Name the planet is nearest to the sun ? ​
Social Sciences, 10 months ago
we can make a globe for a small part of the earth​...