Home / Engineering / Data Structure (DS) / Question

M

Mr. Dubey • 51.17K Points
Coach 

Q.) In a full binary tree if number of internal nodes is I, then number of leaves L are?

(A) L = 2*I
(B) L = I + 1
(C) L = I – 1
(D) L = 2*I – 1
Correct answer : Option (B) - L = I + 1

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Data Structure (DS)

Q. The grammar whose productions are <stmt> → if id then <stmt> <stmt> → if id then <stmt> else <stmt> <stmt> → id := id is ambiguous because a) the sentence if a then if b then c:= d has two parse trees b) the left most and right most derivations of the sentence if a then if b then c:= d give rise to different parse trees c) the sentence if a then if b then c:= d else c:= f has more than two parse trees d) the sentence if a then if b then c:= d else c:= f has two parse trees

Q. Calculate logarithmic decrement if damping factor is 0.33.

Q. The time needed for an output to change from the result of an input change is known as:

Q. This extra information is usually maintained in the form of a at the client.

Q. Pretty good privacy (PGP) is used in ______

Q. Which of the following quantities are minimized directly or indirectly during parameter estimation in Gaussian distribution Model?

Q. Who among the following had established UIDAI by passing Aadhaar Act, 2016

Q. What does PC stand for?

Q. it r-- means

Q. Which of the following data is not required for hazard identification?