Question: Given the code of insert Node elements in a Linked List void Insert (int val) Node *newNode = new Node (); newNode rightarrow data =
Given the code of insert Node elements in a Linked List void Insert (int val) Node *newNode = new Node (); newNode rightarrow data = val; newNode rightarrow next = head; head = newNode; Draw the linked list after the following calls are made. Which node will be the head of linked list? Insert (40); Insert (50); Insert (10); Insert (30); Insert (20)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
