Question

The depth of a complete binary tree is given by​

Answer 1

Answer:

The depth of complete binary tree of n nodes will be Dn=log 2 (n+1). Here Dn is the height or depth of the tree and n is the number of nodes. A complete binary tree is a binary tree where all the levels have maximum number of nodes except possibly the last level.

Answer 2

Answer:

it's the step thorough which the no. is found like in binary tree

1

2. 3

4 5 6 7

we can say 4 and 7 are in 3rd row and this have depth of 3

just like and follow plzz