engineering recuitment ISRO Scientist Computer Science Mock Test Algorithms Graphs/Spanning Tree and Shortest Paths Graph Search
In a complete binary tree with 15 nodes. Let X denote the set of the first 4 elements obtained by performing Breadth-First Search (BFS) starting from the root. Let Y denote the set of the first 4 elements obtained by performing Depth-First Search (DFS) starting from the root. What is the value of |X - Y|?
1
0
2
1
3
2
4
3