6. Implement a simple and COMPLETE program in C++. This program shall: 1) Contain a user...

Transcribed Image Text:

6. Implement a simple and COMPLETE program in C++. This program shall: 1) Contain a user defined method; 2) Contain a driver program (i.e. the main function) which invokes above method; 3) Include any necessary headers. Suggestion: this can be a small program as simple as printing "hello world that includes a main function and a method that prints a string from a parameter. 7. Suppose there is a data type Node. It has a data value field and a link to a next Node. A singly linked list can be formed by such Node instances. Implement the method below to print all values in the list in the reverse order (i.e. print the first node last and the last node first) given a reference to the first Node. You can assume the values are integers. You can give names of data members as you need. Note that there is only one parameter of this method. Hint: use recursion. void reverse_print ( Node* n ) ; 6. Implement a simple and COMPLETE program in C++. This program shall: 1) Contain a user defined method; 2) Contain a driver program (i.e. the main function) which invokes above method; 3) Include any necessary headers. Suggestion: this can be a small program as simple as printing "hello world that includes a main function and a method that prints a string from a parameter. 7. Suppose there is a data type Node. It has a data value field and a link to a next Node. A singly linked list can be formed by such Node instances. Implement the method below to print all values in the list in the reverse order (i.e. print the first node last and the last node first) given a reference to the first Node. You can assume the values are integers. You can give names of data members as you need. Note that there is only one parameter of this method. Hint: use recursion. void reverse_print ( Node* n ) ;