Because i need to traverse through the nodes, i create a node (s) that keep assigning itself the next node till the desired one is reached. BUT TOP IS BEING CHANGED ALSO !!! I think i need a copy constructor for this, but how ???????
Creation : node *s = top; // top is a node also
struct node{
Field *fld;
node *next;
*node(){};
node (const node& incoming){
??????????????????????
}
};
p.s. Field is an abstract base class
(you can't create it, but a pointer to it may well be used)
To make the copy construtor, assign all of the data in the incoming node into your new node. Say you had the struct point.
Code:struct point { int x; int y; point(point &);//copy constructor point(){}; ~point(){}; }; //definition of copy constructor point::point(point &incoming) { x=incoming.x; y=incoming.y; }
that still touches the original memory space.
This is VERY ugly and inefficient way of doing it..
why not use pointer to traverse the nodes??? saves time (especially if it's recursive) and memory!!.
are you traversing a linked list or a tree?
U.
Quidquid latine dictum sit, altum sonatur.
Whatever is said in Latin sounds profound.
U. definately has the correct idea here. This is what u need to do:
1. Create your node class
2. Give a value to your data and create a new node on the free store that the next node points to
3. To go through it, assign a traverser node to the head, then if you want to keep going, reassign the traverser to head's next. Continue assigning it to the current node's next to keep going through the list.
