What are the appropriate data structures for following algorithms?1) Breadth First Search 2) Depth First Search 3) Prim’s Minimum Spanning Tree 4) Kruskal’ Minimum Spanning Tree (A)1) Stack2) Queue3) Priority Queue4) Union Find(B)1) Queue2) Stack3) Priority Queue4) Union Find(C)1) Stack2) Queue3) Union Find4) Priority Queue (D)1) Priority Queue2) Queue3) Stack4) Union Find

Updated on October 1, 2023

Guest

October 1, 2023 at 5:06 am

What are the appropriate data structures for following algorithms?

1) Breadth First Search 2) Depth First Search 3) Prim's Minimum Spanning Tree 4) Kruskal' Minimum Spanning Tree

(A)

1) Stack2) Queue3) Priority Queue4) Union Find

(B)

1) Queue2) Stack3) Priority Queue4) Union Find

(C)

1) Stack2) Queue3) Union Find4) Priority Queue

(D)

1) Priority Queue2) Queue3) Stack4) Union Find

Viewing 1 replies (of 1 total)