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-datanext-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<=p->next->data) && (p->next)));
}

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

Admin · Accepted Answer

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

Admin · Answer

the list is empty or has exactly one element

Admin · Answer

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

Admin · Answer

not all element in the list have the same data value

Q. 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

Discusssion

Q. 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

Discusssion

Q. 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