Graph Algorithm 18

13Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex t at a distance four from the root. If t is the n-th vertex in this BFS traversal, then the maximum possible value of n is

Option : D
Explanation :
Maximum possible value of n for which we have complete tree and our 't' node is the last leaf node at height 4.
So, the maximum possible value of n
= 1 + 2 + 4 + 8 + 16
= 31

Forgot your password?

I agree with the Terms.