一个geeksforgeeks上的题，有更优解吗# JobHunting - 待字闺中
L*y
1 楼
https://www.geeksforgeeks.org/root-leaf-path-maximum-distinct-nodes/
Given a Binary Tree, find count of distinct nodes in a root to leaf path
with maximum distinct nodes.
我在一个面试的时候说了这个解法，结果说还有解法 with less complexity
Given a Binary Tree, find count of distinct nodes in a root to leaf path
with maximum distinct nodes.
我在一个面试的时候说了这个解法，结果说还有解法 with less complexity
