If a tree has two vertices of degree 3, then no. of vertices of degree 1 is

If a tree has two vertices of degree 3, then no. of vertices of degree 1 is

  1. A.

    exactly 4

  2. B.

    at least 4

  3. C.

    at most 4

  4. D.

    None

Attempted by 232 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…