Consider a complete binary tree with 7 nodes. Let A denote the set of first 3…
GATE · 2021 · CS · Set 2 · Computer Science & IT
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 _____________ .
Attempted by 165 students.
Sign up free to check your answer
Sign up freeLoading lesson…