Question

The data structure required for breadth first traversal in a graph is

Answer 1

$\huge\boxed{\fcolorbox{white}{pink}{answer}}$

Here is ur answer mate

⏬⏬⏬⏬⏬⏬⏬⏬⏬⏬

Data Structure - Breadth First Traversal. Breadth First Search (BFS) algorithm traverses a graph in a breadthward motion and uses a queue to remember to get the next vertex to start a search, when a dead end occurs in any iteration.

✔️✔️✔️✔️✔️✔️✔️✔️✔️✔️✔️✔️✔️✔️

↫↫↫↫↫ Hope it helps you

Plz mark me brainlist ↬↬↬↬↬