GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes
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 ________
asked in trees, binary search trees, binary heaps by gate

1 Answer

0 votes
31 for given distance 4
answered by gate

Related questions

The best answer to any question