Insert a Node at Entrance/Starting of a Linked Listing

class Node {

public:

    int information;

    Node* subsequent;

};

struct Node {

    int information;

    struct Node* subsequent;

};

class LinkedList {

    Node head;

    class Node {

        int information;

        Node subsequent;

        Node(int d)

        {

            information = d;

            subsequent = null;

        }

    }

}

class Node:

    def __init__(self, information):

        self.information = information 

        self.subsequent = None 

class LinkedList:

    def __init__(self):

        self.head = None

public class Node {

    public int information;

    public Node subsequent;

    public Node(int d)

    {

        information = d;

        subsequent = null;

    }

}

<script>

    var head;

    class Node {

        constructor(d) {

            this.information = d;

            this.subsequent = null;

        }

    }

</script>

void push(Node** head_ref, int new_data)

{

    Node* new_node = new Node();

    new_node->information = new_data;

    new_node->subsequent = (*head_ref);

    (*head_ref) = new_node;

}

void push(struct Node** head_ref, int new_data)

{

    struct Node* new_node

        = (struct Node*)malloc(sizeof(struct Node));

    new_node->information = new_data;

    new_node->subsequent = (*head_ref);

    (*head_ref) = new_node;

}

public void push(int new_data)

{

    Node new_node = new Node(new_data);

    new_node.subsequent = head;

    head = new_node;

}

def push(self, new_data):

    new_node = Node(new_data)

    new_node.subsequent = self.head

    self.head = new_node

public void push(int new_data)

{

    Node new_node = new Node(new_data);

    new_node.subsequent = head;

    head = new_node;

}

<script>

 perform push(new_data)

{

    var new_node = new Node(new_data);

    new_node.subsequent = head;

    head = new_node;

}

</script>