Test Index

TCS Placement Model Test 6

© examsnet.com

Question : 40

Total: 40

Direction: Mark the best option 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______________.

Your Answer:

Go to Question:

Prev Question