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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 20, 20262026-05-20T17:28:54+00:00 2026-05-20T17:28:54+00:00

struct leaf { int data; leaf *l; leaf *r; }; struct leaf *p; void

  • 0
    struct leaf
    {
        int data;
        leaf *l;
        leaf *r;
    };
    struct leaf *p;


void tree::findparent(int n,int &found,leaf *&parent)

This is piece of code of BST. I want to ask. why

 leaf *&parent

Why we need “reference mark” here?

parent is also a leaf, why can’t I just use leaf* parent?

code below for your reference. Thank you!

void tree::findparent(int n,int &found,leaf *&parent)
{
    leaf *q;
    found=NO;
    parent=NULL;

    if(p==NULL)
        return;

    q=p;
    while(q!=NULL)
    {
        if(q->data==n)
        {
            found=YES;
            return;
        }
        if(q->data>n)
        {
            parent=q;
            q=q->l;
        }
        else
        {
            parent=q;
            q=q->r;
        }
    }
}
  • 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-05-20T17:28:55+00:00Added an answer on May 20, 2026 at 5:28 pm

    You are passing the pointer parent in by reference, so that you can modify that pointer:

    parent=q;
    

    If you passed the pointer in by value, the modifications would be to a copy of the pointer that expires at the end of the function.

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

Sidebar

Related Questions

struct TimerEvent { event Event; timeval TimeOut; static void HandleTimer(int Fd, short Event, void
typedef struct { nat id; char *data; } element_struct; typedef element_struct * element; void
void addNewNode (struct node *head, int n) { struct node* temp = (struct node*)
struct a { int (*ptr1)(); int (*ptr2)(); int data; }; typedef struct { struct
struct B1{ int d; void fb(){}; }; struct B2 : B1{ using B1::d; using
struct DVDInfo *ReadStruct( void ) { struct DVDInfo *infoPtr; int num; char line[ kMaxLineLength
struct DVDInfo *ReadStruct( void ) { struct DVDInfo *infoPtr; int num; char line[ kMaxLineLength
struct node* NewNode(int data) { struct node* node = new(struct node); node->data = data;
struct elem { int i; char k; }; elem user; // compile error! struct
Say I have a struct s with an int pointer member variable i. I

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.