{"id":1789,"date":"2020-06-11T17:12:20","date_gmt":"2020-06-11T17:12:20","guid":{"rendered":"https:\/\/blog.prepbytes.com\/?p=1789"},"modified":"2022-04-19T19:35:46","modified_gmt":"2022-04-19T19:35:46","slug":"insert-a-node","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/insert-a-node\/","title":{"rendered":"INSERT A NODE"},"content":{"rendered":"

\"\"<\/p>\n

Concepts Used<\/h3>\n
\n

Linked list<\/p>\n<\/blockquote>\n

Difficulty Level<\/h3>\n
\n

Easy<\/p>\n<\/blockquote>\n

Problem Statement :<\/h3>\n
\n

You are given a sorted linked list and you have to insert a node in the list in a sorted manner. <\/p>\n<\/blockquote>\n

<\/strong><\/u><\/a><\/p>\n

EXPLANATION:<\/h3>\n

Approach:<\/h4>\n
\n

If the head node is Null<\/code>, then insert the data in the head node. <\/p>\n

Else, if the input data is less than the start node, then insert the node at the start.<\/p>\n

If the input data is greater than the start node, till you get the right position to insert, move the temporary pointer. If the temporary pointer\u2019s next value is null, then insert the node at the end.<\/p>\n

If the element lies between any two values, then connect the node to the previous node and the next node ie, t<\/code>->next<\/code> =<\/code> temp<\/code>->next<\/code> and temp<\/code>->next<\/code> =<\/code> t<\/code>.<\/p>\n

\"\"<\/p>\n<\/blockquote>\n

SOLUTIONS:<\/h3>\n

\t\t\t\t\t\t