logo CodeStepByStep logo

Main Page → Exercises → Week 5 Section → C++ → Solve an Exercise

You are working on problem set: Week 5 Section ( Pause)

isSorted

Language/Type: C++ linked lists pointers

Write a member function named isSorted that accepts a pointer to a ListNode representing the front of a linked list. Your function should return true if the list is in sorted (non-decreasing) order and false otherwise. An empty list is considered to be sorted.

Constraints: Do not construct any new ListNode objects in solving this problem (though you may create as many ListNode* pointer variables as you like). Do not use any auxiliary data structures to solve this problem (no array, vector, stack, queue, string, etc). Your function should not modify the linked list's state; the state of the list should remain constant with respect to your function.

Assume that you are using the ListNode structure as defined below: 

struct ListNode {
    int data;         // value stored in each node
    ListNode* next;   // pointer to next node in list (nullptr if none)
}
Function: Write a C++ function as described, not a complete program.

You must log in before you can solve this problem.

Log In

Need help?

Stuck on an exercise? .

If something seems wrong with our site, please

Is there a problem? Contact us.