# 1. Write a function that steps through a linked list of nodes with ...

## Question

1. Write a function that steps through a linked list of nodes with integer values, changing every other item to zero.
The functionâ€™s parameter should be a pointer to a node, and it should have a local variable that is a node iterator.

2. Write a function that steps through a linked list of nodes with integer values, counting the number of occurrences of zero.
The functionâ€™s parameter should be a pointer to a const node, and it should have a local variable that is a const_node_iterator.
Test both the functions in main()
You can use node2.h and node2.template file

## Solution Preview

These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references. Students may use these solutions for personal skill-building and practice. Unethical use is strictly forbidden.

int main(int argc, char** argv) {
node<int> * n = NULL;

for (int i = 0; i < 5; i++) {
n = new node<int>(i, n);
}

cout << "Current list: ";
Print(n);
cout << "\nNumber of occurrences of zero: " << ZeroCounting(n) << "\n";
cout << "\n";

cout << "Changing every other item to zero\n";
ZeroOut(n);
cout << "Current list: ";
Print(n);
cout << "\nNumber of occurrences of zero: " << ZeroCounting(n) << "\n";

return 0;
}...

By purchasing this solution you'll be able to access the following files:
Solution.zip.

# 50% discount

Hours
Minutes
Seconds
\$23.00 \$11.50
for this solution

or FREE if you
register a new account!

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

### Find A Tutor

View available C-Family Programming Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.