Chapter 3, Problem 25E

Program Plan Intro

Implementation of binary search in linked lists

Program plan:

• Create a structure SLLNode for singly linked list node.
• Create a class SLList for singly linked list.
• Define a function “createNode ()” to create a new singly linked list node.
• Define a function named “insertNode ()” to append a node in the singly linked list.
• Define a function named “sortList ()” to sort the singly linked list in ascending order.
• Define a function named “binarySearchOnList ()” to check whether a search node is present in the singly linked list or not.
• Define a function named “displayList ()” to show the singly linked list.