Insert node at a certain position in a linked list C

Question

I m trying to insert a node at a certain position  In my code  the numbers with position 1 is only being inserted  basically at the beginning of the linked list  and it is not inserting any data with position 2  Is there something wrong with temp2  When I ran the program it is not pointing to anything I think    I know how much you guys hate homework problems being asked here but I just don t know what is wrong with my program  I m just a beginner at this and my teacher didn t explain linked list well   The code is below    -The output that I m getting is 8 7   -I would want it to read 8 6 7 5 where 6 and 5 are inserted at position 2     Insert node at a given positon in a linked list  First element in the linked list is at position 0      include lt stdlib h gt   include lt stdio h gt   struct Node      int data     struct Node  next      struct Node  head   void Insert int data  int n       Node  temp1   new Node       temp1- gt data   data     temp1- gt next   NULL     if  n    1       temp1- gt next   head      head   temp1      return          Node  temp2   new Node       for  int i   0  i  lt  n-2  i       i feel like it doesn t even go through this loop     temp2   temp2- gt next          temp1- gt next   temp2- gt next     temp2- gt next   temp2    void print         Node  temp   head      while temp    NULL           printf   d    temp- gt data           temp   temp- gt next            printf   n      int main         head   NULL    empty linked list     Insert 7 1     List  7          Insert 5 2     List  7 5        Insert 8 1     List  8 7 5      Insert 6 2     List  8 6 7 5           print    system  pause

User · Answer

I had some problems with the insertion process just like you  so here is the code how I have solved the problem   void add by position int data  int pos              link  node   new link          link  linker   head           node- gt data   data          for  int i   0  i  lt  pos  i                 linker   linker- gt next                    node- gt next   linker          linker   head          for  int i   0  i  lt  pos - 1  i                 linker   linker- gt next                    linker- gt next   node          boundaries

User · Answer

Try this function    structure of node object   class Node   private      int data      Node  next   public      Node int        Node        void setData int       int getData        void setNext Node        Node  getNext         Implementation of the function   Returning a status value is always a god practice  constants defined here are meant for debugging logging the application usage     constants static int const SUCCESS   0  static int const FAILURE   1  static int const NULL OBJ   2  static int const POS EXCEED   3   int addAt int data  int pos       Node  tmp   new Node data       if  tmp    NULL             print for debugging only          cout  lt  lt   Object not created  Out of memory maybe   lt  lt  endl          return NULL OBJ            if  pos    0              add at beginning         tmp- gt setNext this- gt head           this- gt head   tmp          return SUCCESS       else             add element in between or at end         int counter   1          Node  currentNode   this- gt head          while  counter  lt  pos  amp  amp  currentNode- gt getNext      NULL               currentNode  currentNode- gt getNext                counter                    tmp- gt setNext currentNode- gt getNext            currentNode- gt setNext tmp          return SUCCESS          cout  lt  lt   Failed due to unknown reason       return FAILURE      Assumption here is that  you will call the function after validating the inputs  data and position   Though we can validate the parameters inside the function  it is not a good practice   Hope this helps

User · Answer

Node  insert node at nth pos Node  head  int data  int position              current node        Node  cur   head          initialize new node to be inserted at given position        Node  nth   new Node      nth- gt data   data      nth- gt next   NULL       if position    0              insert new node at head            head   nth          head- gt next   cur          return head       else             traverse list            int count   0                      Node  pre   new Node           while count    position               if count     position - 1                    pre   cur                            cur   cur- gt next                          count                          insert new node here            pre- gt next   nth          nth- gt next   cur           return head

User · Answer

Insert an element at very beginning position  case-1 when the list is empty  case-2 When the list is not empty        include lt iostream gt   using namespace std   struct Node  int data  Node  next    link    head  stored the address of the next node     Node  head     pointer to Head node with empty list  void Insert int y   void print     int main        head   nullptr    empty list     int n y      cout lt  lt  how many number do you want to enter   lt  lt endl      cin gt  gt n      for  int i 0 i lt n i             cout lt  lt  Enter the number   lt  lt i 1 lt  lt endl          cin gt  gt y          Insert y           print             void Insert int y       Node  temp   new Node      create dynamic memory allocation     temp- gt data   y      temp- gt next   head     temp- gt next   null  when list is empty     head   temp     void print        Node  temp   head      cout lt  lt  List is    lt  lt endl      while temp   nullptr           cout lt  lt temp- gt data lt  lt              temp   temp- gt next            cout lt  lt endl

User · Answer

void addToSpecific       int n      int f 0      flag  Node  temp H       H-Head  T-Tail  if NULL  H           cout lt  lt  Enter the Number  lt  lt endl      cin gt  gt n      while NULL   temp- gt getNext                  if n   temp- gt getInfo                    f 1        break                  temp temp- gt getNext              if NULL  H         Node  nn new Node        nn- gt setInfo        nn- gt setNext NULL       T H nn      else if 0  f         Node  nn new Node        nn- gt setInfo        nn- gt setNext NULL       T- gt setNext nn       T nn      else if 1  f         Node  nn new Node        nn- gt setInfo        nn- gt setNext NULL       nn- gt setNext  temp- gt getNext          temp- gt setNext nn

User · Answer

Node  InsertNth int data  int position      struct Node  n new struct Node    n- gt data data      if position  0        this will also cover insertion at head  if there is no problem with the input         n- gt next head        head n         else           struct Node  c new struct Node        int count 1        c head        while count  position                    c c- gt next            count                  n- gt next c- gt next        c- gt next n           return

User · Answer

Just have something like this where you traverse till the given position and then insert   void addNodeAtPos int data  int pos      Node  prev   new Node      Node  curr   new Node      Node  newNode   new Node      newNode- gt data   data     int tempPos   0       Traverses through the list    curr   head          Initialize current to head    if head    NULL          while curr- gt next    NULL  amp  amp  tempPos    pos                prev   curr          curr   curr- gt next          tempPos              if pos  0               cout  lt  lt   Adding at Head     lt  lt  endl            Call function to addNode from head            else if curr- gt next    NULL  amp  amp  pos    tempPos 1              cout  lt  lt   Adding at Tail     lt  lt  endl           Call function to addNode at tail            else if pos  gt  tempPos 1        cout  lt  lt    Position is out of bounds    lt  lt  endl         Position not valid      else               prev- gt next   newNode          newNode- gt next   curr          cout  lt  lt   Node added at position     lt  lt  pos  lt  lt  endl            else        head   newNode      newNode- gt next NULL      cout  lt  lt   Added at head as list is empty     lt  lt  endl

User · Answer

For inserting at a particular position k  you need to traverse the list till the position k-1 and then do the insert     You need not create a new node to traverse to that position as you did in your code  You should traverse from the head node

[c++] Insert node at a certain position in a linked list C++

Examples related to c++

Examples related to insert

Examples related to linked-list

Examples related to position

Examples related to nodes