Exercise solutions #
Single source shortest paths #
TYPO fixed in column 5 relax 4:
The max space taken by the IndexMinPQ
is O(V - 1).
Decimal to binary, and back
Is a BST seach a P problem? Yes It is also a NP problem. It is not a NP-Complete problem.