Concepts:
Logical representation of inserting a node into a linked list to maintain a sorted list
Three Cases are examined:
Inserting a node into an empty linked list
Inserting a node into a list with at least one node and we want to insert the new node at the head.
Inserting a node into a list with at least one node and we want to insert the new node somewhere other than the head.
Usage of a current pointer.
Usage of a trail or previous pointer.
How pointers must be updated to perform an insert.
On this page of the site you can watch the video online Data Structures Using C++: Inserting a Node into a Linked List (Sorted Linked List) with a duration of hours minute second in good quality, which was uploaded by the user ReelLearning 31 July 2012, share the link with friends and acquaintances, this video has already been watched 120,167 times on youtube and it was liked by 659 viewers. Enjoy your viewing!