c - what is below disp function doing what kind of data structure it is struct linkedlist int val struct linkedlist next head null tail null void dispstruct linkedlist node int cnt 1 struct linkedlist temp head whiletemp null temp node temp tempnext cnt i - skillgun

function disp() is trying to display all the elements of the given single linked list. after printing all the nodes values, it will print sorry all the times.

function disp() is trying to find if a given node is available in this single linked list or not. if given node is available, then it is printing done with the index of that node in this linked list. assuming that starting node index is 0. else it prints sorry.

function disp() is trying to find if a given node is available in this single linked list or not. if given node is available, then it is printing done with the index of that node in this linked list. assuming that starting node index is 1. else it prints sorry.

function disp() is trying to find if a given node is available in this single linked list or not. if given node is available, then it is printing done with the index of that node in this linked list. assuming that starting node index is 0. else it prints sorry. But this logic wont work, because whether node is available or not, it always prints sorry only.

Answer :(B)

function disp() is trying to find if a given node is available in this single linked list or not. if given node is available, then it is printing done with the index of that node in this linked list. assuming that starting node index is 0. else it prints sorry.

Description :

function disp() is trying to find if a given node is available in this single linked list or not. if given node is available, then it is printing done with the index of that node in this linked list. assuming that starting node index is 0. else it prints sorry.