GATE | GATE-CS-2003 | Question 90

Consider the function f defined below.

struct item
{
    int data;
    struct item * next;
};
int f(struct item *p)
{
    return ((p == NULL) || (p->next == NULL) ||
            ((P->data <= p->next->data) &&
            f(p->next)));
}

For a given linked list p, the function f returns 1 if and only if
(A) the list is empty or has exactly one element
(B) the elements in the list are sorted in non-decreasing order of data value
(C) the elements in the list are sorted in non-increasing order of data value
(D) not all elements in the list have the same data value.


Answer: (B)

Explanation: See https://www.geeksforgeeks.org/data-structures-linked-list-question-11/

Quiz of this Question

My Personal Notes arrow_drop_up

Save