kindly solve this as soon as possible

Q6. a. Write two functions int second_highest() and int second_lowest() for a Binary Search Tree class. (5 marks) b. The following piece of code deletes the node from the linked list. This code is working fine but there seems to be a little problem which might bring down the efficiency of this coded linked list when used at a bigger scale. Identify the problem and write the solution to the problem (5 marks) void del (node *ptr) { node* temp; temp = ptr->next; ptr ->next = temp->next; } Hint: ptr is the node whose next node is to be deleted