M

Mr. Dubey • 100.69K 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.

Related MCQs

Q. How many classes can a single .NET DLL contain?

Q. How can parallel data be taken out of a shift register simultaneously?

Q. are scheduled with the Round-Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the pr

Q. A relation R in a set X is symmetric if ________.

Q. Dimensionality reduction reduces the data set size by removing ____________.

Q. Network layer protocol exits in

Q. These are the functions of RFID Reader

Q. LCD uses

Q. In associative mapping, in a 16 bit system the tag field has bits.

Q. A …………….. means a specific action to be taken or not to be taken with respect to situation

Question analytics