Computer Science, asked by garry4469, 1 year ago

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)

Answers

Answered by Anonymous
28
A. Dn = log 2 (n+1)

Hope it helps you
Answered by Anonymous
0
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)
Previous Question
Next Question
Similar questions
English, 6 months ago
The boy in the story ' The boy who drew cats'become very famous after the death of goblin rat. He visit the priest who advised him to avoid large places at the night. write the likely conversation between priest and the boy.​
English, 6 months ago
Q.8: Do not cut trees. They are our lifelines. Do not cut our lifelines which are our trees. o Cut not our lifelines, cut not trees. o Do not cut trees as they are our lifelines. Trees are becoming our lifelines when you do not cut them. O which is a conjunction​...
English, 6 months ago
Teacher (Ought to/ have to/ need/ Ought not) smoke before Student 4 option mein se ek Kyon hoga ​...
Computer Science, 1 year ago
MS-EXCEL is based on A) OS/2 B) UNIX C) WINDOWS D) DOS...
Computer Science, 1 year ago
The clipboard A) is a Cache memory B) is a feature that stores user information C) is used to temporarily store, items that has been cut or copied D) is a feature that saves file temporarily...
Sociology, 1 year ago
According to the mbti a successful top executive is likely to be a/an...
Sociology, 1 year ago
According to 2011 census, the state with lowest literacy rate in india is...
Chemistry, 1 year ago
Which of the following is not a biodegradable polymer?