What is the minimum possible depth of a d-ary tree?
In d-ary tree, each node has at most d children
a) loga n+1
b) ſlogan
c) ſlogan+1]
d) ſlogan
Answer
<
a
0
0
Answers
Answered by
14
Answer:
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.
Explanation:
Answered by
0
Answer:
llogdn+
Explanation:
Similar questions