  We present an algorithm for a fault tolerant Depth First Search (DFS) Tree in
an undirected graph. This algorithm is drastically simpler than the current
state-of-the-art algorithms for this problem, uses optimal space and optimal
preprocessing time, and still achieves better time complexity. This algorithm
also leads to a better time complexity for maintaining a DFS tree in a fully
dynamic environment.
