Graph Search on Data Structure and Algorithms related Questions and Answers

Question :   Choose the incorrect statement about DFS and BFS from the following? 1. BFS is equivalent to level order traversal in trees 2. DFS is equivalent to post order traversal in trees 3. DFS and BFS code has the same time complexity 4. BFS is implemented using queue Answer :   2 - DFS is equivalent to post order traversal in trees