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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 30, 20262026-05-30T15:04:24+00:00 2026-05-30T15:04:24+00:00

In C, if I have a tree or linked list, I have to declare

  • 0

In C, if I have a tree or linked list, I have to declare a function for insertion like

insert(Node ** node) 

so I can insert a new root/head.
My question is, how to write it with references in C++?

  • 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-30T15:04:24+00:00Added an answer on May 30, 2026 at 3:04 pm

    You would write the function as

    ReturnType insert(Node* &node)
    

    That is, the parameter is a reference to the Node* variable holding the root of the tree. From there, you would proceed as usual, except that compared with the C version of the function you wouldn’t need to dereference node to reassign the root For example, if you were to write the following in the initial (C) version of the code:

    *node = /* ... something ... */
    

    You would just write

    node = /* ... something ... */
    

    in the updated version of the code.

    Hope this helps!

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

Sidebar

Related Questions

So I have a tree structure in a SQL-Server database. Each node is linked
I have a tree structure in memory that I would like to render in
I have a tree of active record objects, something like: class Part < ActiveRecord::Base
I have a tree data structure that is L levels deep each node has
I have tree structures that are stored in a DB table. The table can
This is a follow-up question to Combinatorics in Python I have a tree or
I am trying to create a complete binary tree using a linked list, instead
Can anyone explain why databases tend to use b-tree indexes rather than a linked
I have a table with a representation of a linked list id | parent
I have tree control object created using CTreeCtrl MFC class. The tree control needs

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.