Question

The depth of a complete binary tree is given by
A) Dn = log 2 (n+1)
B) Dn = log 1/2 (n+1)
C) Dn = log (n+1)
D) Dn = log 2 (n-1)

Answer 1

Hey !!! Question :- The depth of a complete binary tree is given by

A) Dn = log 2 (n+1)

B) Dn = log 1/2 (n+1)

C) Dn = log (n+1)

D) Dn = log 2 (n-1) Answer :- Option A  Dn=log 2(n+1) Hope this helps :)

Answer 2

The depth of a complete binary tree is given by

A) Dn = log 2 (n+1)

B) Dn = log 1/2 (n+1)

C) Dn = log (n+1)

D) Dn = log 2 (n-1)

Correct option of this question is A) Dn = log 2 (n + 1)

Explanation:

                    A entire binary tree is a binary tree in which all of the degrees have most quantity of nodes besides probably the closing level. The intensity of entire binary tree of n nodes could be Dn=log 2 (n+1) in which Dn is the peak or intensity of the tree and n is the quantity of nodes.

What is binary tree?

                            The Binary tree method that the node will have most  children. Here, binary call itself indicates that ''; therefore, every node will have both 0, 1 or 2 children.

Example :

               The above tree is a binary tree due to the fact every node carries the maximum  children.

Nodes -

              A binary tree is made from nodes, wherein every node includes a "left" reference, a "right" reference, and a records element.

#SPJ2