Question $60$

Identify the error in the following algorithm for traversing a linked list.

ListTraverse$($list$)\{$ curNode $=$ list$-$head while

$($curNode is not null$)$ i Print

curNode's data curNode $=$ list$-$head$-$next

$\}$

$$ The statement $($while $($curNode is not null$)$ should be while $($curNode is null$).$

$$ The statement $($while $($curNode is not null$)$ should be while $($list$-$tail is not null$).$

$$ The statement curNode $=$ List$-$head$-$next should be curNode $=$ curNode$-$next $.$

$$ The statement curNode $=$ list$-$head should be curNode $=$ list$-$tail.