Instead of calling dfs function and storing each node in result array then sorting, we can just call dfs function then we can loop over visited array, sort adds overhead of O(vlon(v))