Which of the following is not an application of Breadth First Search?
A)when the graph is a binary tree
B)when the graph is a linked list
C)when the graph is a n-ary tree
D)when the graph is a ternary tree

Question

Quizplus · Accepted Answer

Breadth First Search (BFS) is applicable to various types of graphs, including binary trees, n-ary trees, and ternary trees, as it traverses the graph level by level. However, when the graph is a linked list, BFS is not a practical application because a linked list is essentially a linear structure, making depth-first search or simple iteration more suitable and efficient for traversal or search operations.

Which of the Following Is Not an Application of Breadth