I need it's solution.

Please implement the bool DeleteMin0 function which finds and deletes the node whose data value is the smallest in the whole list. Please note there is no Delete function available (to call from within this function) and you have to take care of the deletion yourself in the function. The function returns true if successful and false otherwise. The performance of your function should be no worse than O(n)