I get confused with the problem desc

  • 0

    Can someone help? What does this child-parent-child really mean?

    On the other hand, the path can be in the child-Parent-child order, where not necessarily be parent-child order.

    Example 1:
    2 3
    Output: 2
    Explanation: The longest consecutive path is [1, 2] or [2, 1].

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.