Solved

setting value to a pointer of a linklist

Posted on 2004-10-03
3
251 Views
Last Modified: 2010-04-01
I have made the following linklist. How can I create a loop

say for example if I want to set first->next->next=something;

then I want to set first->next->next->next=something;

I hope I am clear enough, what I need to do is replace ->next .. by a loop so if need 3 ->next I just run a for loop 3 times. I am doing it because I need to add a node at the nth position of my list; If the list already has some elements. For example the function addnth which I have tried to implement. The function is generic to add a node at the 2nd position from head. But I need it to be versatile enough to add at any location. However I am unable to do that because of difficulty in moving to first->next.....I even tried using pointer to pointer but was unable to do that.

_______________________________________
struct node
{
   int x;
   node *next;

};


class linklist
{

      node *first;
      int length;
public:
      linklist()
      {
            first= NULL;
            length=0;
      }

                void addlink(int d);
      void display();
      void addnth(int d,int n);

};

void linklist::addnth(int d,int n)

{

      node *current=first;
      node *temp=0;      
      node **temp1=0;
      node *m=0;



      for (int i=1;i<3;i++)
      {
      
            current=current->next;
      }

      temp=current;

                node *newlink=new node;

      newlink->x=d;

      first->next->next=newlink;
      
      /*
      m=first->next->next;
      temp1=&m;
               *temp1=newlink;
               */

    newlink->next=temp;


}
0
Comment
Question by:anshuma
  • 2
3 Comments
 
LVL 55

Accepted Solution

by:
Jaime Olivares earned 350 total points
ID: 12212895
I think will be no errors. Please advice.

void linklist::addnth(int d,int n)
{
    node *current=first;
    node *newNode= new node;
    newNode->x = d;
 
    if (n==1) {    // special case, first
        newNode->next = first;
       first = newNode;
       return;          
    }

    for (int i=1;i<(n-1);i++) {
       if (current->next)    // this statement prevent outbound
          current=current->next;
    }

    newNode->next = current->next;
    current->next = newNode;            
}
0
 

Author Comment

by:anshuma
ID: 12212923
Great it worked but I was trying to do the same in my code. Could you point me to my folly. How can I solve this with a pointer to pointer approach.

-regards
0
 
LVL 55

Expert Comment

by:Jaime Olivares
ID: 12212935
Sorry, I can not undestand why do you want to use pointer to pointer.
I doesn't make much sense to me.
0

Featured Post

Is Your Active Directory as Secure as You Think?

More than 75% of all records are compromised because of the loss or theft of a privileged credential. Experts have been exploring Active Directory infrastructure to identify key threats and establish best practices for keeping data safe. Attend this month’s webinar to learn more.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Suggested Solutions

Introduction This article is the first in a series of articles about the C/C++ Visual Studio Express debugger.  It provides a quick start guide in using the debugger. Part 2 focuses on additional topics in breakpoints.  Lastly, Part 3 focuses on th…
Basic understanding on "OO- Object Orientation" is needed for designing a logical solution to solve a problem. Basic OOAD is a prerequisite for a coder to ensure that they follow the basic design of OO. This would help developers to understand the b…
The goal of the video will be to teach the user the concept of local variables and scope. An example of a locally defined variable will be given as well as an explanation of what scope is in C++. The local variable and concept of scope will be relat…
The viewer will be introduced to the member functions push_back and pop_back of the vector class. The video will teach the difference between the two as well as how to use each one along with its functionality.

939 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question

Need Help in Real-Time?

Connect with top rated Experts

4 Experts available now in Live!

Get 1:1 Help Now