The depth of a complete binary tree with ‘n’ nodes is (log is to t – McqOptions

MCQOPTIONS

1.	The depth of a complete binary tree with ‘n’ nodes is (log is to the base two)
A.	log(n+l) – 1
B.	log(n-1) + 1
C.	log(n)
D.	log(n) + 1
Answer» B. log(n-1) + 1

Discussion

No Comment Found

Related MCQs

  Which keyword cannot be used while defining property?
Static properties cannot be initialized using
In object oriented programming, by wrapping up characteristics and behavior into one unit, we achieve
What is a size of empty class in c++?
Which of the following operators can not be overloaded in C+ +?
Which of the following concepts means adding new concepts to a program as it runs?
Which of the following correctly describes overloading of functions?
Which of the following function is used to find the first occurrence of a given string in another string?
Identify which of the following are declarations 1 : extern int x; 2 : float square ( float x ) { ... } 3 : double pow(double, double);
Which of the following statements are correct about an array? 1: The array int num[26]; can store 26 elements. 2: The expression num[1] designates the very first element in the array. 3: It is necessary to initialize the array at the time of declaration. 4: The declaration num[SIZE] is allowed if SIZE is a macro.