Home » Programming & Data Structure » Programming and data structure miscellaneous » Question

Programming and data structure miscellaneous

Programming & Data Structure

  1. Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _______.
    1. 18
    2. 8
    3. 27
    4. 9
Correct Option: A

A tree with 10 vertices has 9 edges.
Such that, n = 10, e = (n – 1) = 10 – 1 = 9
then, ∑degree (Vi) = 2 [edges (E)] = 2 × 9 = 18.



Your comments will be displayed only after manual approval.