In a ternary tree, the number of internal nodes of degree 1,2 , and 3 is 4,3 , and 3 respectively. The number of leaf nodes in the ternary tree is
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. 10
Explanation
Leaves = 1 + Σ(d − 1)·n_d = 1 + 0 × 4 + 1 × 3 + 2 × 3 = 10.
More Data Structures and Algorithms questions
- Match List I with List II and choose the correct answer from the code given below. Where V and E are the number of vertices and edges in th…
- A K-colouring of an undirected graph G = (V, E) is a function c : V → {0, 1, …, K − 1} such that c(u) ≠ c(v) for every edge (u, v) ∈ E. For…
- Consider a singly linked list. What is the worst case time complexity of the best-known algorithm to delete the node a, pointer to this nod…
- The second smallest of n elements can be found with ____________ comparisons in the worst case.
- Consider the pseudo-code fragment, where m is a non-negative integer that has been initialized: p = 0; k = 0; while (k < m) p = p + 2^k; k…
- The solution of the recurrence relation T(m) = T(3 m/4) + 1 is :