Vidyalelo
Data Structure · Q365

Miscellaneous on Data Structures

Programming · Data Structure · question 365

Q365

For an euler tour of a tree, how many vertices are required to store euler tour?

A.
2 * V - 1
Answer
B.
2 * V + 1
C.
2 * V - E + 1
D.
2 * V

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board