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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 13, 20262026-06-13T03:23:34+00:00 2026-06-13T03:23:34+00:00

q_node * pop(Queue * que) { if ((que->size == 0) || (que == NULL))

  • 0
q_node * pop(Queue * que) {
   if ((que->size == 0) || (que == NULL)) return null;
   q_node * item = que->head;
   if (freeNode(que)) {
      que->size--;
      return item;
   } else return null;
}

When I try to compile I get the above warning for the bottom line of this function. The structs q_node and Queue compiled with no problems, as did freeNode()…any ideas what I’m doing wrong?

I also get the error “null undeclared” for the first if statement line.

  • 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-13T03:23:35+00:00Added an answer on June 13, 2026 at 3:23 am
    q_node * pop(Queue * que) {
       if ((que->size == 0) || (que == NULL)) return NULL;
       q_node * item = que->head;
       if (freeNode(que)) {
          que->size--;
          return item;
       }
       return NULL;
    }
    

    remove the else statement is useless. No warnings now ^_^
    Gcc see you miss a return statement at the end and is letting you know just in case.

    EDIT: null -> NULL

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

MergePoint (LinkList list1, LinkList list2){ p = list1.head; q = list2.head; while (p.next!=null &&
my Q is there any way to get the word count or the content
Here is a java code for breadth-first travel: void breadthFirstNonRecursive(){ Queue<Node> queue = new
I am trying to implement a Queue in C. Coming from Java and other
I'm implementing a simple priority queue in C for a kernel and so I
I want to make a priority queue of nodes, wherein priority of nodes is
#include <iostream> using namespace std; struct Node { int item; // storage for the
#include <iostream> using namespace std; struct Node { int item; // storage for the
How do I get the value of the text from the example below? Q.js
Hi everyone: Here i have created a queue from two stacks: You add to

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.