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

PYQ Accenture Hiring Assessment 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 248 students.

Sign up free to check your answer

Sign up free

Explore the full course: Cdac C Cat Complete Preparation

Loading lesson…