Insert node in a Linked List

Easy

You're given the following 2 inputs:

The data for a new node to be inserted in a singly linked list.
The node left_node that the new node should be inserted after.

Write a function that inserts the new node after the left_node in its singly linked list.

For example, let's use the following linked list as an example:

(1) -> (5) -> (7) -> (2)

If your function is passed the data 8 and the third node in the above list with the data 7, the linked list should become:

(1) -> (5) -> (7) -> (8) -> (2)

Assume that the input left_node can be any node in the list..

Try it first

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

def insert_node(new_node: Node, left_node: Node):
    # insert new_node after left_node
    return

1class Node:
2    def __init__(self, data):
3        self.data = data
4        self.next = None
5
6def insert_node(new_node: Node, left_node: Node):
7    # insert new_node after left_node
8    return
9

Solution

8 Essential Linked Lists Coding Interview Problems

Master Linked Lists by trying the coding challenges below.

Want to confidently pass your next coding interview?

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.