Given an example of a graph with n vertices for which the queue of Breadth$-$first

Search $($BFS$)$ will have n $1$ vertices at one time, whereas the height of the recursion tree of Depth$-$First

Search $($DFS$)$ is at most one. Both searches are started from the same vertex.