Suggest a tree where Depth First Search (DFS) offers better performance, i.e. less number of steps to find a goal state, than Iterative Deepening DFS (IDDFS). Visualize your tree, precisely locating all the goal states, and provide the corresponding calculations, also for the performance of Breadth First Search (BFS).