Question

Consider the function f defined below:

struct item
{
int data;
struct item *next;
};
int f(struct item *p)
{
return (
(p == NULL)$\parallel$
(p$\to$ next == NULL $\parallel$
((p$\to$data <= p$\to$ next$\to$ data )
&& f(p $\to$ next))
);
}

For a given linked list p, the function f returns 1 if and only if

• A. the elements in the list are sorted in non-increasing order of data value
• B. not all elements in the list have the same data value
• C. the list is empty or has exactly one element
• D. the elements in the list are sorted in non-decreasing order of data value

Answer 1

The correct option is D the elements in the list are sorted in non-decreasing order of data value

For given linked list p, the function f returns 1 if and only if the elements in the list are stored in non-decreasing (increasing) order of the data value.

f returns 1 if p == NULL or p$\to$ Next == NULL or p$\to$ data <=p$\to$next $\to$ data,
satisfies in linked list for every node p.