Need more examples and detailed explanation.
It\'s not clear from start which node you need to return. Also it\'s not clear what to do if node is deepest and it hasn\'t any child. For example:\n\n1 -> 2 ->
It\'s not clear from start which node you need to return. Also it\'s not clear what to do if node is deepest and it hasn\'t any child. For example:\n```\n1 -> 2 -> 3\n```\nWhat do we need to return? 3 as deepest one or 2 as root which has deepest node.\n\nI\'ve solved this problem and the hardest thing was to understand the description. Everything else is just simple `DFS`
[]