GATE 2021 CS SET2 Q16. Consider a complete binary tree with 7 nodes. [DATA STRUCTURE][SOLVED!]

GATE 2021 CS Question Paper Complete Solution - PYQ 2021

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

---------------------------------------------------------------------------
GATE 2021 All links:https://gate.iitb.ac.in/G21/index.php

GATE 2021: Questions & Keys: https://gate.iitb.ac.in/G21/21_Final_...

CS Set 1:
QP: https://drive.google.com/file/d/1l0Wd...
Key: https://drive.google.com/file/d/1Yue4...

CS Set2:
QP: https://drive.google.com/file/d/1msqM...
Key: https://drive.google.com/file/d/19-3n...
------------------------------------------------------------------------
Gate Helpline helps you in gate notifications, PSU, previous year papers, gate admit card, gate cutoff marks, gate results, scorecard, gate helpline number etc Gate Helpline provides a unique feature of Question Answer Discussion.
--------------------------------------------------------------------------
Follow Us on Youtube Channel:
https://www.youtube.com/c/Gatehelplin...

Gate Helpline:
http://gatehelpline.com/

Follow Us on Facebook:
  / gatehelplinedotcom  

Follow Us on Twitter:
  / gatehelpline