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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 14, 20262026-06-14T07:01:32+00:00 2026-06-14T07:01:32+00:00

I have something of the form: struct Tree { string rule; list<Tree*> children; }

  • 0

I have something of the form:

struct Tree {
    string rule;
    list<Tree*> children;
}

I’m trying to print it out from within this for loop.

for(list<Tree*>::iterator it=(t->children).begin(); it != (t->children).end(); it++) {
    // print out here
}
  • 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-14T07:01:33+00:00Added an answer on June 14, 2026 at 7:01 am

    You can always turn recursion into iteration. Here’s with an auxiliary queue:

    std::deque<Tree *> todo;
    
    todo.push_back(t);
    
    while (!todo.empty())
    {
        Tree * p = todo.front();
        todo.pop_front();
    
        std::cout << p->rule << std::endl;
    
        todo.insert(todo.end(), p->children.begin(), p->children.end());
    }
    

    In C++11 this would of course be a for loop:

    for (std::deque<Tree *> todo { { t } }; !todo.empty(); )
    {
        // ...
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have an ASP.NET MVC form laid out something like this: @using (Html.BeginForm(null, null,
i have done something like this: <form action=validate.php method=get> Id :<input type=text name=pID/><br/><br/> Name
I have a simple html form that is structured something like this: <form name=test
I have a form something like this: <form> <ul> <li>...</li> <li><input type=submit value=go /></li>
I have something like this HTML structure : <form name=myvalue id=hello> <input type=text name=name
Currently, I have something like: public partial class Form1 : Form { delegate void
I have an array of strings of the form: @source = ( something,something2,third ,something,something3
I have a form with two selectfields. I would like that when something is
I have a PictureBox control on a Form that is supposed to draw something
I need some help with something... say I have the following form... <form name=

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.