InterviewSolution
Saved Bookmarks
| 1. |
All trees with n vertices consists of n-1 edges.(a) True(b) FalseMy question is taken from Undirected Graph in division Graph of Data Structures & Algorithms II had been asked this question in an internship interview. |
|
Answer» RIGHT CHOICE is (a) True To explain: A trees is ACYCLIC in NATURE. |
|