Breadth First Search (BFS) is started on a binary tree beginning from the root…
GATE · 2016 · CS · Set 2 · Computer Science & IT
Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex at a distance four from the root. If t is the -th vertex in this BFS traversal, then the maximum possible value of is _____________ .
Attempted by 152 students.
Sign up free to check your answer
Sign up freeLoading lesson…