)Define a class that implementsa singly linked list with the following methods, assuming that the first node of a linked list is referred to by head: i) A constructor. ii) searchNode that takes asparameter an integer value and returns a reference to the node with that value if it is found,and null otherwise. i)addlnOrder that allows insertion of a node to the linked list such that the list remainssorted in ascendingorder. iv) displayList which displays all the nodes in the linked list. d) Assuming that the class defined in part (c) aboveis used to implement a queueof positive integers, define the following methods which can be used to implement queueoperations: i) isEmptythat returns true if the queue is empty andfalse otherwise. ii) pop that returns the value of the first node if the linked list is not empty,and -1 otherwise. iii) push that takes as parameteran integer value and adds it to the end of the queue.
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
c)Define a class that implementsa singly linked list with the following methods, assuming that the first node of a linked list is referred to by head:
i) A constructor.
ii) searchNode that takes asparameter an integer value and returns a reference to the node with that value if it is found,and null otherwise.
i)addlnOrder that allows insertion of a node to the linked list such that the list remainssorted in ascendingorder.
iv) displayList which displays all the nodes in the linked list.
d) Assuming that the class defined in part (c) aboveis used to implement a queueof
positive integers, define the following methods which can be used to implement queueoperations:
i) isEmptythat returns true if the queue is empty andfalse otherwise.
ii) pop that returns the value of the first node if the linked list is not empty,and -1 otherwise.
iii) push that takes as parameteran integer value and adds it to the end of the queue.
Step by step
Solved in 4 steps with 1 images
