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:

| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
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 - Starting time ST[i]:2 4 1 3 - Ending time FT[i]:2 4 4 4
The Tree Looks Like:

| Name |
|---|


