Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Graphs/Spanning Tree and Shortest Paths Graph Search
BFS is implemented on a complete binary tree starting from the root vertex. The vertex to be searched is at a distance of 9 from the root. If the required vertex is at nth position in this BFS traversal, then the maximum and minimum possible value of n is
1
1024, 511
2
1023, 511
3
1023, 512
4
1024, 512