5 years ago in Data Structure

Queue can be used to implement ?

[A] quick sort

[B] merge sort

[C] heap sort

[D] insertion sort

Loading...

Next Question

Overall Stats

Attempted 366

Correct 53

Incorrect 119

Viewed 194

Guest

Poonam Singla - 4 years ago

Queue can be used to implement heap sort..not for quick sort.this is implemented by stack

Comments (0)

Serkie Mekonnen - 5 days ago

Serkie Mekonnen from Dessie, Ethiopia is saying insertion sort is correct answer

Narender Kumar - 2 weeks ago

Narender Kumar is saying quick sort is correct answer

Marem Husen - 1 month ago

Marem Husen from Al Musayyib, Iraq is saying heap sort is correct answer

Uga Balu - 1 month ago

Uga Balu from Chennai, India is saying insertion sort is correct answer

View 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.

View Answer