Question

what is the minimum possible depth of a d-art tree?
In d-ary tree, each node has at most d children

a) [logdn +1]
b) [logdn]
c) [logdn + 1]
d) [logdn]

Answer 1

Answer:

[logdn]

Explanation:

Depth of a tree can be defined as the shortest path and that path is from root to head of tree. if we compare height and depth of a tree

depth of tree is always one less than its height in other words we can say that height of a tree is one more than the depth of a tree.

The root is the only node at level 0 in the tree, and its depth is one less than height of tree.

depth of binary tree can be calculated as [loddn] where as height of binary tree can be calculated as [logdn +1]