» Unlabelled » A connected graph T without any cycles is called | Data Structure

Tuesday, 28 August 2012

A connected graph T without any cycles is called | Data Structure

A. a tree graph
B. free tree
C. a tree
D. All of above

Ans: D


at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)