What data structure is typically used to implement Breadth-First Search (BFS) graph traversal?
Answer and explanation
Correct answer: C. Queue
- Step 1: Breadth-First Search explores vertices in order of their distance from the source root node.
- Step 2: A First-In, First-Out (FIFO) Queue is essential to process neighboring nodes level by level in the exact order they are discovered.
Answer
Queue.
Why not the others: 'Stack' is used to implement Depth-First Search (DFS); 'Binary Search Tree' is an ordered tree structure; 'Disjoint Set' is used in Kruskal's minimum spanning tree algorithm.
Practise more Python Programming, Data Structures, Algorithms, Networks and Cybersecurity.
Free questions with an explanation for every one, and full timed Saudi Secondary School Certificate mock tests.
More Python Programming, Data Structures, Algorithms, Networks and Cybersecurity questions
- What is the time complexity of searching for an element in an unsorted array of elements using linear search?
- What is the output of the following Python expression: `[x**2 for x in range(5) if x % 2 == 1]`?
- Which data structure operates on a Last-In, First-Out (LIFO) access principle?
- Which SQL clause is used to filter aggregated group records after a `GROUP BY` statement has been applied?
- What type of network topology connects all nodes to a central forwarding device such as a network switch?
- In cybersecurity, what type of malicious attack overwhelms a web server with massive volumes of traffic from multiple compromised sources to…