Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8556311
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 11, 20262026-06-11T15:19:08+00:00 2026-06-11T15:19:08+00:00

I have implemented a short linked list code to add to the beginning of

  • 0

I have implemented a short linked list code to add to the beginning of the list.

However the head always contained NULL. I really couldn’t get why its behaving in this way. Any help is appreciated ! Below is the code :

#include<stdio.h>
#include<stdlib.h>

typedef struct node
{
    int iData;
    struct node *next;
} Node;

void add2Beg(Node* head, int num);


int main(int argc, char const *argv[])
{
    Node *head = NULL;
    add2Beg(head, 5);
    if (head == NULL)
        printf("nothing in head !!!\n");
else{
    printf("not null\n");
}
    add2Beg(head, 15);
    return 0;
}

//adds to the beginning of the linked list
void add2Beg(Node* head, int num)
{
    //create a temporary location to hold the new entry
    Node* temp = (Node *)malloc(sizeof(Node));
    temp->iData = num;

    if(head == NULL)
    {
        head = temp;
        printf("inside add2Beg\n");
        printf("%d\n", head->iData);
        head->next = NULL;
        printf("exiting add2Beg\n");
    }
    else
    {
        temp->next = head;
        printf("%p\n", temp->next);
        head = temp;
    }

}
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-11T15:19:10+00:00Added an answer on June 11, 2026 at 3:19 pm

    Because you never assigned head to anything other than NULL…

    //here you set it to NULL then pass it to your function
    Node *head = NULL; 
    add2Beg(head, 5);
    

    here in your function you pass in a copy of “head”

    void add2Beg(Node* head, int num)   
    {
       //create a temporary location to hold the new entry   
        Node* temp = (Node *)malloc(sizeof(Node));   
        temp->iData = num;      
        if(head == NULL)     //we'll get in here
    

    At this point you assign temp to it, so within the scope of this function it’s something vaid, but once you leave this function it’s back to NULL.

    You passed in a copy of the pointer “head” and called it “head”. You need to either return the value and assign it in main() or pass a pointer to head into this function in order for the value to be updated.

    Solutions:

    Node *head = NULL; 
    head = add2Beg(head, 5);
    
    Node* add2Beg(Node* head, int num){
        ...
        return head;
    

    OR

    Node *head = NULL; 
    add2Beg(&head, 5);
    
    void add2Beg(Node** head, int num){
        ...
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have implemented correctly bump's api, and added this code: - (void) configureBump {
I have my graph implemented with linked lists, for both vertices and edges and
I have implemented the Data Mapper pattern with the Identity Map pattern. In short:
I have implemented an adapter for my ListView which extends BaseAdapter. My list items
I am creating a student list (linked list) that can add, view and edit
I have an unsorted linked list. To sort it, I thought I'd put the
i want to implement this in c#, i have my linked list class ready,
I want to created a generic sorted linked list. Thus I have an abstract
I have implemented a sort of Repository class and it has has GetByID ,
I have a buffered grid on which I've implemented a local sort function (client

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.