Single source shortest path problems can be implemented by Greedy method using

1
Red – black trees
2
Min heap
3
AVL trees
4
none

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation