topic description
there are n elements in an integer queue. Is there an n-independent method to delete a specific
element in this queue? If possible, please give your data structure and deletion algorithm, the algorithm is expressed by a function, the definition of the function is as follows; if
is not possible, please state your reason.
function definition:
void DeleteNode(ListNode *pListHead, ListNode *pToBeDeleted)
{
//
}
sources of topics and their own ideas
for the postgraduate entrance examination questions of Zhejiang University of Technology, I feel that it is impossible to have such an algorithm at all. But isn"t there no need to do that big problem at all?