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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 31, 20262026-05-31T21:35:55+00:00 2026-05-31T21:35:55+00:00

struct node { node(int _value, node* _next) : value(_value), next(_next) {} int value; node*

  • 0
struct node
{
    node(int _value, node* _next) : value(_value), next(_next) {}

    int   value;
    node* next;
};

node *p = new node(10, NULL);
delete p;

Based on my understanding, operator delete will first call the destructor of node, then deallocate the raw memory block originally allocated for p.

Since struct node doesn’t provide a customized destructor, the compiler will provide a default one.

Question1>what does the default destructor look like?
For example,

node::~node()
{
  next = NULL;
}

Question2>should we define a destructor for struct node or not?
I assume that we don’t have to explicitly provide such a destructor. The reason is that the member variable next doesn’t own the pointed resource and it behaves as a weak_ptr. Is that correct?

  • 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-31T21:35:57+00:00Added an answer on May 31, 2026 at 9:35 pm

    Sounds correct to me.

    Because struct node is a “Plain Old Datatype” the compiler won’t actually create any destructor code at all, there’s no need to specially destruct ints or pointers.

    Even for non-POD types, the compiler default destructor will just take the form:

    ~node() { }
    

    Individual members will still have their destructors called, but if you didn’t allocate any non-automatic resources, you generally don’t need to provide a destructor. There are situations where you might, but they’re somewhat special purpose.

    You may want to refer to this question on the rule of three.

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

Sidebar

Related Questions

struct Node { int value Node* next; } typedef List Node* const Set operator
// Variables typedef struct node { int value; struct node *next; }mynode; // Globals
struct node { int id; float weight; }; int find_last(struct node Prio_Q[]) { int
struct Edge; struct Node { int id; vector<Edge> *edges; }; struct Edge { int
Having construction in a form: struct Node { Node():left_(nullptr), right_(nullptr) { } int id_;
Write a class ListNode which has the following properties: int value; ListNode *next; Provide
typedef struct vertex{ int num; struct vertex *next; } Vertex; Vertex *adj[1]; void buildList(){
struct node { Item item; node *l, *r; node(Item x) {item = x; l
this is a b-day reminder code utilizing linkedlists typedef struct node { char name[61];
I am tring to intialize an array of pointers to a NODE struct that

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.