let's say i have these
and lets say they gave me an struct stra positionand i want to drive my main list of type struct strb to go to that location how can i do that?Code:struct stra{struct stra next;int value;}; struct strb{struct stra head; struct stra tail;int size;};
is that way correct?
because if i move the x wouldn't change my list position? as they are pointers? im really confused
for(struct stra x=l->head;x!=position;x=x->next);
first off that is only a structure, what you want is structure pointerOriginally Posted by cable
unless your doing your entire program without functions
Last edited by camel-man; 10-10-2011 at 11:44 AM.
If you throw in some pointers, it seems OK.
Code:struct stra{struct *stra next;int value;}; struct strb{struct *stra head; struct stra *tail;int size;}; for(struct stra *x=l->head;x!=position;x=x->next);
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
thanks..
i have one more question about linked lists
lets say i have a list with head and a (tail at the end) (and lets say its like a circle) the last item which is the tail points at the beginning
if i have a node_t location(which points at the part of list i want to remove) (node_t is the pointers=next,head,tail) which one is the best algorithm to do it? (you know , i have to bind the previous with the next of the current ) and then free(current)
i have coded one but is really ugly ,big and used a lot of variables
Code:node_s *pointed_var; ( the pointed variable which points at the part i want to remove) list_d list; (the main list) list has node_s* tail and *head )
Last edited by cable; 10-10-2011 at 05:51 PM.
start_node its the node which search should be start for deleting nodes(if you don't find meaning with it, me either but i have to use it
Code:node_t * locate_node(list_t * l, node_t *start_node, int pos){ int i; node_t *pointer=start_node; for(i=1;i<pos;i++) pointer=pointer->next; return pointer; } void node_delete(list_t *l, node_t* start_node, int pos) { node_t *cur; node_t *pre=NULL; for(cur=l->head;cur!=start_node;pre=cur,cur=cur->next); if(pre==NULL) pre=l->tail; node_t *pointer=locate_node(l,start_node,pos); pre->next=pointer->next; free(pointer); (l->size)--; if(l->d) print_list(l); }
