Given a connected undirected graph, return the Depth First Traversal of this graph starting from node 0.
[
5,
[
[
1,
2,
3
],
[],
[
4
],
[],
[]
]
][
0,
1,
2,
4,
3
][
4,
[
[
1,
3
],
[
2
],
[
0
],
[]
]
][
0,
1,
2,
3
]Sign in to Run Code and Submit