The following code deletes the rightmost node of a doubly linked list. Identify the missing statement
R = R → lptr ;
?
R → rptr = NULL ;1
free (R)
2
free (R → rptr)
3
free (R → lptr)
4
None of these
The following code deletes the rightmost node of a doubly linked list. Identify the missing statement
R = R → lptr ;
?
R → rptr = NULL ;