M

Mr. Dubey • 52.43K Points
Coach 

Q. A binary tree of depth "d" is an almost complete binary tree if __________.

(A) each leaf in the tree is either at level.
(B) for any node.
(C) both a and b.
(D) None.
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. The DES algorithm has a key length of ______.

Q. We can also compute the coefficient of linear regression with the help of an analytical method called “Normal Equation”. Which of the foll

Q. The software which governs the group of computers is

Q. Application level gateway firewalls protect the network for specific _____________

Q. Which of the following is used as the embedded SQL in COBOL?

Q. Which one is not a stage of COCOMO-II?

Q. The tar command in UNIX

Q. The counter that keeps track of how many times a block is most likely used is

Q. Which of the proposition is p ^ (~p v q) is

Q. The real part of an antenna’s input impedance is due to

Question analytics