consider the function f defined here: struct item { int data; struct item * next; }; int f (struct item *p) { return((p==NULL) ||((p-next==NULL)||(p-data next-data) && (p-next))); } For a given linked list p, the function f returns 1 if and only if

Question

consider the function f defined here: struct item { int data; struct item * next; }; int f (struct item *p) { return((p==NULL) ||((p->next==NULL)||(p->data next->data) && (p->next))); } For a given linked list p, the function f returns 1 if and only if

Accepted Answer

the element in the list are sorted in non-decreasing order of data value

consider the function f defined here: struct item { int data; struct item * next; }; int f (struct item *p) { return((p==NULL) ||((p->next==NULL)||(p->data<=p->next->data) && (p->next))); } For a given linked list p, the function f returns 1 if and only if

Make the most of this question