Question: Given a singly linked list of n nodes (the linked list pointed by HEAD pointer), each node contains two fields (Data and Link). Write two
Given a singly linked list of n nodes (the linked list pointed by HEAD pointer), each node contains two fields (Data and Link). Write two C++ functions one to find and return the smallest element in linked list and the second to find and return the largest element in linked list.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
