Multiple Choice
A connected graph T without any cycles is called?
A) A tree graph
B) Free tree
C) A tree
D) All of the above
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q2: When representing any algebraic expression E which
Q3: The depth of a complete binary tree
Q4: Which data structure allows deleting data elements
Q5: Recursion is the process of repeating items
Q6: In a graph if e=(u,v)then?<br>A)e never reaches
Q8: The post-order traversal of a hypothetical binary
Q9: The x-intercept refers to?<br>A)Any plot of points
Q10: The gradient refers to?<br>A)The distance between two
Q11: A binary search tree can sometimes be
Q12: Which type of sort algorithm repeatedly steps