Question: Consider this function prototype: bool delFirst ( Node ( : T : ) * * & head ) . What is the correct implementation? a

Consider this function prototype: bool delFirst(Node (:T:)**& head). What is the correct implementation?
a.
if (head==0)
return 0 ;
Node (:T:)*** temp=head;
delete temp;
head=head->next;
?bar( return 1; )
b.
if (head==0)
return 0 ;
Node (:T:)* temp=head;
head=head->next;
delete temp;
return 1;
c.
if (head==0)
return 0 ;
head=head next ;
?bar( Node )(:bar(T):)*** temp=head;
delete temp;
return 1;
d.
if (head==0)
return 1 ;
Node (:T:)* temp=head;
head=head->next;
delete temp;
return 0 ;
 Consider this function prototype: bool delFirst(Node (:T:)**& head). What is the

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!