Data Structures | Linked List | Question 11

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 (GATE CS 2003)

(A)

not all elements in the list have the same data value.

(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)

None of them

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :

Share your thoughts in the comments

GeeksforGeeks

Trending in News