Consider a complete binary tree with 7 nodes. Let A denote the set of first 3…

2024

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 _____________ .

  1. A.

    1

  2. B.

    2

  3. C.

    3

  4. D.

    4

Attempted by 160 students.

Show answer & explanation

Correct answer: A

Explanation:

In case of BFS if we draw complete binary tree then in Set A we have level1+level2. In DFS we have level1+ level 2 + level 3.

So A-B= remaining element of level 2.

Explore the full course: Accenture Preparation