Data Structures and Algorithms (Link List Problems) - Tirthankar Pal - MBA from IIT Kharagpur, GATE, GMAT, IIT Written Test, Interview were a part of MBA Entrance, B.S. in Computer Science from NIELIT

 (a) Insert a new node after a given node.

          void insert_node(node *new_node, node *old_node)

          {

               temp = NULL;

               temp = old_node;

               old_node->next = new_node;

               new_node->next = temp;

           }

(b) Delete last node.

        

                                    #include <iostream>

                                    using namespace std;

                                     /* Link list node */

                                    struct Node {

                                                  int data;

                                                  struct Node* next;

                                     };

 

                                    /* Function to remove the last node 

                                        of the linked list */

                              Node* removeLastNode(struct Node* head)

                                    {

                                             if (head == NULL)

                                              return NULL;

 

                                             if (head->next == NULL) {

                                             delete head;

                                             return NULL;

                                              }

 

                                              // Find the second last node

                                              Node* second_last = head;

                                              while (second_last->next->next != NULL)

                                                     second_last = second_last->next;

 

                                             // Delete last node

                                                      delete (second_last->next);

 

                                              // Change next of second last

                                                         second_last->next = NULL;

 

                                     return head;

                                }   

 

(c) Count the number of elements in the list

      int count = 0;

      while(curr != NULL)

      {

          count++;

           curr = curr->next;

     }

     printf(count);

Tirthankar Pal

MBA from IIT Kharagpur with GATE, GMAT, IIT Kharagpur Written Test, and Interview

2 year PGDM (E-Business) from Welingkar, Mumbai

4 years of Bachelor of Science (Hons) in Computer Science from the National Institute of Electronics and Information Technology

Google and Hubspot Certification

Brain Bench Certification in C++, VC++, Data Structure and Project Management

10 years of Experience in Software Development out of that 6 years 8 months in Wipro

Selected in Six World Class UK Universities:-

King's College London, Durham University, University of Exeter, University of Sheffield, University of Newcastle, University of Leeds