I'm interested in whether we can Construct a tree if we know the Starting Time and Ending Time of all the Vertices.
For Example: - Number of Vertices :4
- Starting time ST[i]:2 4 1 3
- Ending time FT[i]:2 4 4 4
The Tree Looks Like:

Constructing a Tree Using It's Timestamp.
I'm interested in whether we can Construct a tree if we know the Starting Time and Ending Time of all the Vertices.
For Example: - Number of Vertices :4
The Tree Looks Like:
