Data Structures Using C++: Traversing a Linked List

Concepts:
Understanding how one may traverse a linked list.
Using a traversal pointer that starts at the head.
How traversal of a linked list can be used for many linked list operations - printing the contents of the list, inserting nodes, removing nodes, finding nodes that meet a criteria etc.

Related Videos:

[felixkimutai]

This guy is amazing...thanks for your crystal clear explanation

[JamesBrodski]

Thank you so much! This is exactly what I needed. God bless :)

[NehadHirmiz]

Thank you for these awesome tutorials. Could you please do a tutorial series on Buffers, circle buffers and memory mapping?

[mohdadyg]

Hi, this is very concise example, clear explanation and slowly goes to the goal; Thanks a lot.

[ntslkarma]

btw if anyone has trouble with this shit do it all in one class it makes things wayyy easyier

[alexw]

Great explanation thanks so much for doing this. Also what compiler are you using?

[tilak]

Thanks for the time making the tutorial :)

[류아리아]

This video was a great help! Can I ask what application or compiler you're using?

[MegaForrestfire]

what if i don't want to just out put the whole list and just a specific node(it's value, next node and the weight )?

[tx]

HI, I'm just wondering if you can list a complete codes of this sorted linked list, I was trying to write one but it keeps getting error and I just can't find what went wrong.

[colt]

errors on my part: undefined error to ContactList:: ContactList()
undefined reference to ContactListLL:: addToHead(std:: string....)
undefined reference to ContactList::printList()

I can'ts seem to solve these errors

[lifebytheminute]

it only prints "Name:" and does not output the names that were entered.

[nhiap]

why not just cout << tp->name;