Back to Building a Linked List
Next Lesson: Insertion and Deletion

Build, Print, Free

Medium

Read integers with the sentinel loop into a head-inserted linked list, print it head to tail with its node count, then free every node. The full list lifecycle: checked allocation in, exactly one free out, with the head-insertion reversal on display.

Success Criteria

Your code must pass 3 test case(s) to complete this exercise. 3 hint(s) are available if you need help.

Sign in to track your progress

You can work on exercises as a guest, but sign in to track your progress and save your submissions.

Sign In Create Account

This platform is built by its community

Every lesson, project, and tool on HelloC++ is funded by sponsors. Join them and help shape what we build next.

Become a Patron

How did you find this exercise?

Your rating helps us improve the content.