Which operation is better for storing items in an array than

Which operation is better for storing items in an array than storing items on a linked list? Growing the size of the container, inserting an item at the beginning (position 0) retrieve a copy of the item at location i. deleting an item at the beginning (position 0). You are working with a node class named node. Suppose that f is a non-member function with a prototype like this with a missing data type in the parameter list void f (_ head_ptr);//Precondition head_ptr is a head pointer for a linked list.//Post condition The function f has done some computation with//the linked list, but the list itself is unchanged What is the best data type for head_ptr in the parameter list of this function? node* node node* & node& Which of the following is a pure abstract function? pure virtual double area () = (); virtual double area () = 0; abstract double area (); virtual double area () (area = 0 y; Consider the following.

Solution

Question 9:

retrieving the copy of an item at location i

Question10:

since head is a pointer node* should be used and linked list is unchanged so node * is the correct option.

Question 11:

virtual double area() = 0;