GATE Computer Science (CS) 2021 Shift 2 Solved Paper

© examsiri.com
Question : 26 of 65
 
Marks: +1, -0
Consider a complete binary tree with 7 nodes. Let A denote the set of first 3 elements obtained by performing Breadth-First Search (BFS) starting from the root. Let B denote the set of first 3 elements obtained by performing Depth-First Search (DFS) starting from the root.
The value of |A - B| is _______
  • Your Answer:
Go to Question: