BFS and DFS

It means broad or wide or the algorithm will progress horizontally

Data structure of Breadth First Algorithm

• FIFO

• LIFO

• LIFI

• FILI

Data structure of Depth First Algorithm

• FIFO

• LIFO

• LIFI

• FILI

The term pop is used in what data structure

• FILI

• LIFO

• FIFO

• LIFI

In the BFS code, this is the term used to add somethng

Data structure of Depth First Search

• queue

• stack

• pop

• push

What is the color code of the nodes to be visited

• gray

• red

• black

• pink

What is the root node both used in the video

• Node A

• Node B

• Node C

• Node D

Complete the statement: The time complexity of dfs is _ _ _ _ of the number of vertices plus number of edges

BFS: queue[ ] = DFS=stack [ _ _ _ _ _ ]