M

Mr. Dubey • 100.69K 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
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. approach of a relationship between the systems.

Q. ____________ are the algorithms are available to update contents of routing tables

Q. Find the simplified expression A’BC’+AC’.

Q. Executable atomic computations are called as ________

Q. Governance policies, rules, as well as authority structures apply to which key resource element of the organisation?

Q. Choose the correct statement

Q. In a system, which has 32 registers the register id is long.

Q. The Family of recursive language is not closed under which of the following operations:

Q. Who was the first person to solve the maximum matching problem?

Q. Data Model is collection of conceptual tools for describing -

Question analytics