Chapter 20, Problem 10PC

Program Plan Intro

MaxNode function

Program Plan:

“Main.cpp”:

• Include the required header files.
• Declare the necessary function prototype and constants.
• Define the main () function.
  • Declare the necessary variables.
  • Insert the values into the list.
  • Displays to user that the values are inserted.
  • Call the method “maximumnode()” to find the largest element of the list.
  • The largest valued node gets displayed.

“NumberList.h”:

• Define the template function necessary.
• Define the class “NumberList”.
• Declare the necessary structure variables.
• Define the constructor and destructor.
• Declare the necessary function prototype.

“NumberList.cpp”:

• Include the required header files.
• Declare the necessary function prototype and constants.
• Define the method named “nodeappend()”,
  • Declare the necessary variables
  • Validate the list using if statement to find the status of the list.
  • Use loop to iterate for the contents present in the list and add node to the last of the list.
• Define the method named “viewlist()”,
  • Declare the necessary variables.
  • Use loop that iterates to display the elements present in the list.
• Define the method named “insertval()”,
  • Declare the necessary variables.
  • Validate the content of the list using if statement.
  • After evaluation of the list the contents the values are inserted at the desired location.
  • Loop is used to iterate for the values that are present, to validate whether the particular element is greater or lesser than the elements present in the list.
  • After evaluation the value is inserted at the desired location.
• Define the method named “removenode()”,
  • Declare the necessary variables.
  • Validate the list using if statement in order to position the list based on the elements that is deleted from the list.
• Define the method named “~NumberList()”,
  • Declare the necessary variables.
  • Loop that iterates to delete the memory allocates.
• Define the method named “sortlist()”,
  • Declare the necessary variables.
  • Use loop to iterate for the value of the list.
  •  A condition statement to compare the elements of the list and return the sorted list.
• Define the method named “mergeval()”,
  • Loop that is used to iterate to merge the values of the list based on the list values.
  • Call the function “sortlist()” to sort the value after being merged.
• Define the method named “maximumnode()”,
  • Return the head node to be the maximum node.
• Defined the method named “maxNode()”,
  • Use a condition statement to validate the elements of the list to identify the maximum value that is present in the list.