adplus-dvertising
frame-decoration

Question

In a binary tree, the number of terminal nodes (leaf nodes) are 10, then the numbers of nodes with two children are

a.

9

b.

10

c.

11

d.

20

Answer: (a).9

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In a binary tree, the number of terminal nodes (leaf nodes) are 10, then the numbers of nodes with two children are

Similar Questions

Discover Related MCQs

Q. If S(n,e) represents the maximum additional space taken by DFS for an n-vertex, e-edge graph,  then what is the value of S(n,e), if adjacency lists are used.

Q. Breaking down a problem into several sub problems is known as…….

Q. Alpha cutoff and Beta cutoff are combined to get………

Q. A graph G is bi-connected if and only if ………..

Q. The common vertex of two bi connected components is called …………

Q. If two queens are placed at position (i, j) and (k,l). Then they are on the same Diagonal if and only if………

Q. A node which has been generated and all of whose children have not yet been generated is…….

Q. In the sum of subsets problem, if n=4, (w1, w2 w3, w4) = (11, 13, 24, 7) and m=31 then solutions are .........
(where 1 represents weight chosen and 0 represents weight is not choosen.)

Q. Painting all the verticies of a graph with colors such that no two adjacent vertices have the same color is called………of the graph.

Q. A sufficient condition for a simple graph G with n vertices have a Hamiltonian cycle is that the degree of every vertex in G is atleast……..

Q. Choose the properties of the asymptotic notation given below:

1) Reflexivity & transpose symmetry
2) Asymmetry& reflexivity
3) Symmetry& transitivity
4) Symmetry& equity

Q. The searching technique that takes O(1) time to find a data is

Q. Which of the following sorting algorithms does not have a worst case running time of O(nlog n)?

Q. An undirected graph G with n vertices and e edges is represented by adjacency list. What is  the time required to generate all the connected components?

Q. The quick sort algorithm exploits……..design technique.

Q. The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is

Q. Which of the following statements are TRUE?

 (1) The problem of determining whether there exists a cycle in an undirected graph is in P.
 (2) The problem of determining whether there exists a cycle in an undirected graph is in NP.
 (3) If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.

Q. The best case time complexity for a successful binary search is O(1). Similarly the best case time complexity for an unsuccessful binary search is…….

Q. State the worst case time complexity for quick sort.

Q. A search technique where we keep expanding nodes with least accumulated cost so far is called