Question 11189 – Programming
November 28, 2023Question 7824 – Computer-Networks
November 28, 2023Question 2599 – Data-Structures
Given a tree with k nodes, the sum of degrees of all nodes is
Correct Answer: B
Question 394 Explanation:
The number of edges in tree with “k” nodes are K-1..
According to the handshaking lemma , the sum of the degree is 2* number of edges So the option B is suitable one.
According to the handshaking lemma , the sum of the degree is 2* number of edges So the option B is suitable one.
2k-1
2*(k-1)
2k+1
2((k+1)
Subscribe
Login
0 Comments