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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 28, 20262026-05-28T19:55:51+00:00 2026-05-28T19:55:51+00:00

void deleteAllNodes () { stack <parentBranch *> mystack; // `trunk` is the existing head

  • 0
void deleteAllNodes ()
{
    stack <parentBranch *> mystack;

    // `trunk` is the existing head node
    mystack.push (trunk);

    cout << mystack.top ()->content;
}

In this case a “copy” of trunk gets pushed in the stack? So, does this means that at a time there are two trunks present in the memory?

  • 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-28T19:55:53+00:00Added an answer on May 28, 2026 at 7:55 pm

    Nope. trunk points to an object, but isn’t the object itself. Like a sign that reads “Car –>” next to a car. When you push trunk onto mystack, you don’t get another car. You just get another sign pointing to the same car.

    Woe be it if you drive the car off (i.e. delete trunk;). Then you’ll have a whole bunch of signs that point to a car, but when someone comes along and tries to get in that car, they’ll fall flat on their rear. All the signs pointing to the car will be liars.

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

Sidebar

Related Questions

void addNewNode (struct node *head, int n) { struct node* temp = (struct node*)
void (int a[]) { a[5] = 3; // this is wrong? } Can I
void display() { list *newlist; newlist = first; cout << endl; do { if
void currentfor() { if(current == NULL) { cout << You don't have any members
void test() { int buf[1000]; //populate buf foo(buf);//is this correct? Can we pass buf
void operator<< (const Integer& left, const Integer& right) { cout << \n: << right.i;
void insert_string( std::vector<std::string> & strings, const std::string &s ) { std::vector<std::string>::iterator it=lower_bound(strings.begin(),strings.end(),s); if(strings.size()>0) std::cout<<*it<<
void Player::move(Board &board, Solver &solver){ Position* best = solver.find_best_move(&board); cout<<Score: <<best->get_score()<<endl; cout<<Board: ; best->get_board()->print_board();
void some_func(int param = get_default_param_value());
void foo(void **Pointer); int main () { int *IntPtr; foo(&((void*)IntPtr)); } Why do 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.