Thread: Structs and Linked Lists

Hey,

So, I've been working on this all day and I'm going crazy as to why my linked list isn't actually linking together. What I mean is that when I print it out, it will only print out the node that was last inserted into the list. I have no idea what's going on. Help me please! Below is a snippet of my code..

Code:

 
struct Sort_list{
    int null_bool; //if 0, then not null; if 1, then null
    int val1; //int
    struct Sort_list *next;
};


typedef struct Sort_list* sort_list;



sort_list head, tail, curr;

int Insert(sort_list list, void *newObj){


    void *p1 = malloc(sizeof(int));
    void *p2 = malloc(sizeof(int));
    int num;
    int value;
    int c = 0;


    if(list->null_bool == 1){ // if the list is empty
        list->val1 = *(int*)newObj;
        list->null_bool = 0;
        head = list;
    }else{ // if the list is not empty
        list->val1 = *(int*)newObj;
        tail->next = list;
    }


    tail = list;
    tail->next = NULL;


    return 0;
}

note: I'm also working with void pointers, but I don't think it's really the issue. So, just ignore those parts..

note:: Tell me if you need more of my code to understand it better.

I'm not really sure how to change my program around this. Forgive me, I'm rusty with the syntax.

Is there anything wrong though with the initial implementation of my code though?

For instance:
When I input 1, 2, and 3 and print out the list. Only 3 would print out..

Originally Posted by ChickenChowMinh

Is there anything wrong though with the initial implementation of my code though?

The insert function is updating a copy of list, as opposed to updating list itself. There's no need for a null boolean variable, much less in every instance of a node, since an empty list is indicated when head and tail are NULL.

When you grab a piece of paper and a pencil and draw your list on paper, does it look correct?

Originally Posted by rcgldr

The insert function is updating a copy of list, as opposed to updating list itself. There's no need for a null boolean variable, much less in every instance of a node, since an empty list is indicated when head and tail are NULL.

I prefer a dummy node, but *shrug*

How do I go about updating the list itself instead of the copy? This whole time I was assuming that "List" was actually being updated ><

Originally Posted by ChickenChowMinh

How do I go about updating the list itself instead of the copy? This whole time I was assuming that "List" was actually being updated ><

Draw it on paper, scan your drawing and post it... maybe then it will be a bit more understandable

I actually have a paper filled with doodles of different possible linked lists and it seems correct to me. But then again, I've been trying to write this code for hours. So, I maybe off..

Originally Posted by ChickenChowMinh

I actually have a paper filled with doodles of different possible linked lists and it seems correct to me. But then again, I've been trying to write this code for hours. So, I maybe off..

Well, the code doesn't matter all that much. The drawing (that I hope you will draw) is quite clear and implementing the code from the drawing really should be fairly straightforward

I reiterate my drawings into my code, but I think my issue is syntax. I'm kind of uncomfortable with passing structs and such.

The only thing that's a downer is that my class doesn't allow us to change the functions in any way. So, it pretty much prevents me from coding freely the way I actually like to code. But, I'll work on it a bit more and update later!

Originally Posted by ChickenChowMinh

I reiterate my drawings into my code, but I think my issue is syntax. I'm kind of uncomfortable with passing structs and such.

The only thing that's a downer is that my class doesn't allow us to change the functions in any way. So, it pretty much prevents me from coding freely the way I actually like to code. But, I'll work on it a bit more and update later!

What has your class given you?

• struct Sort_list (Y/N)
• typedef struct Sort_list* sort_list; (Y/N)
• int Insert(sort_list list, void *newObj); (Y/N)
• sort_list head, tail, curr; // Globals (Y/N)

Originally Posted by ChickenChowMinh

I'm kind of uncomfortable with passing structs and such. The only thing that's a downer is that my class doesn't allow us to change the functions in any way.

The code isn't passing structs, the parameters for the insert function are a pointer to a node struct, and a pointer to a new object. So I assume that the node struct is allocated elsewhere. The insert function should just set list->data to the integer value from *newObj. There's no reason to allocate any memory in the insert function. The declaration for the global variables, head, tail, and curr, should initialize them to NULL.