在加权二叉树中找到最大长度约束的路径。

UPDATE

I worked out an algorithm that I think runs in O(n*k) running time. Below is the pseudo-code:I worked out an algorithm that I think