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 8120395
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 6, 20262026-06-06T05:09:09+00:00 2026-06-06T05:09:09+00:00

I have a singly linked list with node and list structs defined as: typedef

  • 0

I have a singly linked list with node and list structs defined as:

typedef struct _node
{
   int data;
   node* next;
} node;

typedef struct _list
{
   node* start;
} list;

I wrote a function to remove the leading entries of a particular value from the list, but it doesn’t seem to be working as intended. After running my function and reprinting my list, instead of the element no longer being there, there is a large value in its place (around 134520848). My function for removing leading values of a defined value is:

void removeLead(list* l, int n)
{
   node* current = l->start;
   node* temp = NULL;

   while (current->data == n)
   {
      temp = current;
      l->start = current->next;
      free(temp);
   }
}

If I have 4 leading values == n then, after running removeLead(), I have 3 leading entries of ~134520848.

  • 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-06T05:09:10+00:00Added an answer on June 6, 2026 at 5:09 am

    There is a mistake in the code. You are not reassigning the current variable.

    void removeLead(list* l, int n)
    {
       node* current = l->start;
       node* temp = NULL;
    
       while (current->data == n)
       {
          temp = current;
          current = current->next;
          if(l->start == temp)
              l->start = current;
          free(temp);
       }
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Suppose, I have a singly linked list and its basic building block is, struct
I have a singly-linked list containing 1 value in each element. struct listElement {
Possible Duplicate: Reverse a singly linked list reverse a linked list? I have been
I have a singly linked list and I need to sort it in constant
I have to permute N first elements of a singly linked list of length
I have a very simple C code for constructing a Singly Linked list as
I have written this function to delete the last node of a singly linked
I have a Linked List and I want to implement a function: Random_Shuffle_List (struct
Below, I wrote a primitive singly linked list in C. Function addEditNode MUST receive
Delete every 't'th (t>1) node of a single linked list. In the resultant linked

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.