helen wants to find the spanning tree of the graph using breadth first search. Which of the following data structures should she be using?
1. Queue
2. Stack
Choose the correct answer from the options given below.
Answers
Answer:
However, carbon black is widely used as a model compound for diesel soot for diesel oxidation experiments. Carbon black is mainly used as a reinforcing filler in tires and other rubber products.
...
Carbon black.
Names
CAS Number 1333-86-4
3D model (JSmol) Interactive image
ECHA InfoCard 100.014.191
EC Number 215-609-9
Answer:
Helen should use a Queue data structure to find the spanning tree of the graph using a breadth-first search.
Explanation:
Queue Data Structure
The queue is a linear data structure that is similar to an array except that we can perform the insertion from only one end and delete the data only from the other end.
The inserting end is known as the front of the queue while the deletion end is known as the rear of the queue.
Advantage of Queue for Breadth-first Search
Following are the advantages of the queue for performing a breadth-first search:
- The queue will optimize the performance as insertion and deletion are separately performed.
- The queue can be prioritized but the stack cannot give priority to any element.
- Queues are often used in the process and CPU scheduling too so they are the better choice.
#SPJ2