Match Data Structures Characteristics or Applications 1) List a) Heap 2) Stack b

Question

Match Data Structures Characteristics or Applications 1) List a) Heap 2) Stack b) A collection without duplicate values c) FIFO 3) Queue d) Dijkstra's Shortest PathAlgorithm 4) Priority Queue 5) Symbol Table e) LIFO 6) Set f) An ordered collection, allow getting, adding, or removing element at the specific index 7) Binary Tree g) Can be used to support phonebook operations efficiently 8) Graph 9) Indexed Priority h) Can be used to model social network i) Each node can have at most two children Queue

Explanation / Answer

1)List-> An ordered ollection , allowing gettin, adding or removing...(f)
2) Stack -->LIFO (e)
3) Queue->FIFO(c)
4) PriorityQueue->Heap(a)
5)Symbol Table: Can be used to support phone book operations effeciently (g)
6) Set-> A collection without duplicate values . (b)
7)Binary Tree-> Each node can have max two children . (i)
8) Graph->Can be used to model Social network . (h)
9)Indexedpriority Queue: Djistra Shortest Path (d)



Thanks, Please rate and provide feedback..let me know if there is any concern.

Related Questions

Navigate

• Browse (All)
• Browse M
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.