UGC NET CS 2011 June-Paper-2
November 27, 2023Question 4883 – UGC NET CS 2018-DEC Paper-2
November 27, 2023Question 10701 – Data-Structures
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.
Starting with the above tree, while there remains a node v of degree two in the tree, add an edge between the two neighbors of v and then remove v from the tree. How many edges will remain at the end of the process?
Correct Answer: A
Question 191 Explanation:
n1 = 3
n3 = 1
So, option (A) satisfies.
2 * n1 – 3
n2 + 2 * n1 – 2
n3 – n2
n2 + n1 – 2
Subscribe
Login
0 Comments