Network-Security
August 23, 2024Data-Structures
| Question 27 |
A binary tree with n > 1 nodes has n1, n2 and n3 nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbors.
n3 can be expressed as
| n1 + n2 – 1 | |
| n1 – 2 | |
| [((n1 + n2)/2)] | |
| n2 – 1 |
Question 27 Explanation:
n1 = 3
n2 = 1
n3 = 1
So, option (B) satisfies.
Correct Answer: B
Question 27 Explanation:
n1 = 3
n2 = 1
n3 = 1
So, option (B) satisfies.
Subscribe
Login
0 Comments