Hello!
Given a binary tree, find a** maximum path for each node**.
Hope to get an optimal solution Input- N=6
edges= 1->2,2->3,1->4,4->5,4->6
output= 2 3 4 3 4 4
Thanks in advance!
# | User | Rating |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | TheScrasse | 158 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 144 |
Hello!
Given a binary tree, find a** maximum path for each node**.
Hope to get an optimal solution Input- N=6
edges= 1->2,2->3,1->4,4->5,4->6
output= 2 3 4 3 4 4
Thanks in advance!
Name |
---|
You can solve this problem using DP on trees, check this tutorial
solition in O(n log n)
lets find the answer for node V. V has O(logN) nodes in path from V to root. Let U — node in this path. then also let's find for each V max_d[V] — max len from V to some node in subtree of V.
let's try to update the answer for V. there's a exactly one son of U, who is in the path from V to root, let it be Z. then there's the algorithm to find the ans for V, if U is known.
i think it's pretty obvious why it works. so then whole alg is this: