Given a binary tree,
We have to remove a single edge and partition the tree into two new trees such that difference of their diameters remains less than a given constant k.
Please suggest me an approach of O(n) time complexity.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3657 |
| 3 | jiangly | 3638 |
| 4 | turmax | 3442 |
| 5 | tourist | 3380 |
| 6 | Um_nik | 3353 |
| 7 | strapple | 3350 |
| 8 | squareOf105 | 3346 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3310 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 150 |
| 4 | AmShZ | 144 |
| 4 | Um_nik | 144 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 135 |
| 9 | maroonrk | 133 |
| 10 | Proof_by_QED | 131 |
→ Find user
→ Recent actions
Partition a Binary Tree
Revision en2, by go_rob, 2017-04-07 17:08:32
History
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/19/2026 21:50:00 (g2).
Desktop version, switch to mobile version.
Supported by
