Why DFS with or without backtracking step is equivalent in permutations problem (or in general case)?

Question

I wrote two functions, dfsBackTracking and dfsNoBackTracking for permutaions problem, but they seem equivalent.

I understand that in dfsNoBackTracking, I store every