Computer Sciences > GATE 2021 SET-2 > Trees
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 _______.
Correct : 1 to 1
Similar Questions
Consider the expression tree shown. Each leaf represents a numerical value, which can either be 0 or 1. Over all possible choices of the values at the leaves, t...
Which of the following statement(s) is/are TRUE for any binary search tree (BST) having n distinct integers?
Consider a binary tree T in which every node has either zero or two children. Let n>0 be the number of nodes in T.Which ONE of the following is the number of no...
Total Unique Visitors
Loading......