Queue can be used to implement ?
Queue can be used to implement heap sort..not for quick sort.this is implemented by stack
Serkie Mekonnen from Dessie, Ethiopia is saying insertion sort is correct answer
Narender Kumar is saying quick sort is correct answer
Marem Husen from Al Musayyib, Iraq is saying heap sort is correct answer
Uga Balu from Chennai, India is saying insertion sort is correct answer
- [A] Optimal binary search tree construction can be performed efficiently using dynamic programming.
- [B] Breath first search cannot be used to find converted components of a graph.
- [C] Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
- [D] Depth first search can be used to find connected components of a graph.
- [A] Stack
- [B] Set
- [C] List
- [D] Queue
- [A] 16
- [B] 12
- [C] 6
- [D] 10