Question

Breadth 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 ______.

Answer 1

Correct answer is 31

→ Required vertex is 31^st vertex.