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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 14, 20262026-06-14T20:58:35+00:00 2026-06-14T20:58:35+00:00

I am having issue returning a pointer to a struct. Can some explain what

  • 0

I am having issue returning a pointer to a struct. Can some explain what I am doing wrong? I want the search() to return a pointer to the matching input. That will be stored into a vector in case their are duplicates in the “array”. This seems to work however I cannot get the “data” from the pointer returned?

struct Node
{
    int data;
    Node *left;
    Node *next;
};

vector<Node *> array;


void find(int & input)
{
     currentSize = 0;
     vector<Node *> hold;

    for( int i = 0; i < array.size( ); i++ ){
        if(search(array[i], input) != NULL)
        {
            hold.push_back(search(array[i], input));
        }
        else{
            cout << "The Key is not found" << endl;
        }

    }

    for(int i = 0; i < hold.size(); i++)
    {
        cout << hold[i] << endl;
        //Problem here:: I want to see the "data" that the search function returned not the hex value
    }
}


Node * search(Node * x, const int & input)
{
    if( x == NULL )
    {
       return NULL;
    }
    else
    {
        if(input == x->element)
        {
            return x;
        }
            search(x->left, input);
            search(x->next, input);
    }
}
  • 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-14T20:58:36+00:00Added an answer on June 14, 2026 at 8:58 pm

    You need to turn compiler warnings on.

    Not all code paths of search return a value, in particular, is the warning you should be getting if your compiler isn’t being brain dead.

    To fix this, replace this:

                search(x->left, input);
                search(x->next, input);
        }
    }
    

    with:

                Node* leftSearch = search(x->left, input);
                if (leftSearch)
                  return leftSearch;
                return search(x->next, input);
        }
    }
    

    The search() recursive calls do not automatically ferry their return values over to the return value of the current function. 🙂

    In addition, as noted by Zack, you need to look at some subfield of the Node to print it. First check if the return value is nullptr (or NULL in non-C++11 capable compilers) (if it is null, you can’t dereference it safely, and it indicates the search failed).

    If it isn’t nullptr‘, do a ->data on it before you print.

    Ie, change:

        cout << hold[i] << endl;
    

    to:

        if (hold[i]) {
          cout << "Found: " << hold[i]->data << "\n";
        } else {
          cout << "Not Found\n";
        }
    

    note that I’m not using std::endl, because I don’t see the need to flush the buffer on each line.

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

Sidebar

Related Questions

Issue I'm having is returning some data in a sidebar depending on which category
Ok, having an issue withe the return value of a function always returning undefined
I am having some issues with code that is returning a pointer to a
I am having an issue with NSDictionary returning null for an NSString even though
I'm having an issue using Stripes validation method. It works but rather than returning
I am having an issue returning css from a web api controller. The code
I am having an issue with a while statement only returning one result. this
So I'm teaching myself Python, and I'm having an issue with lists. I want
I'm having an issue with Ruby 1.8.7 strftime where the %z is returning the
I am having an issue with getting a Multiple search working with a IQueryable.Where

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.