list.cpp

//#include <iostream>
//#include <string>
//#include <vector>
//
//using namespace std;
//
//class Domain
//{
//public:
//    Domain(string lbl) : m_label(lbl) {}
//    string label() const { return m_label; }
//    const vector<Domain*>& subdomains() const { return m_subdomains; }
//    void add(Domain* d) { m_subdomains.push_back(d); }
//    ~Domain();
//private:
//    string m_label;
//    vector<Domain*> m_subdomains;
//};
//
//Domain::~Domain()
//{
//    for (size_t k = 0; k < m_subdomains.size(); k++)
//        delete m_subdomains[k];
//}
//
void listAll(const Domain* d, string path) // two-parameter overload
{
    vector<Domain*>::const_iterator it = d->subdomains().begin();
    //base case
    //if (n is a child node)
    //{
    //  cout << path << endl;
    if (d == nullptr || d->subdomains().size() <= 0)
    {
        cout << path << endl;
        return;
    }
    //loop through vector
    while (it != d->subdomains().end())
    {
        //recursive call
        listAll(*it, (*it)->label() + "." + path);
        it++;
    }
}
//
//void listAll(const Domain* d)  // one-parameter overload
//{
//    if (d != nullptr)
//        listAll(d, d->label());
//}
//
//int main()
//{
//    Domain* d1 = new Domain("ucla");
//    d1->add(new Domain("cs"));
//    d1->add(new Domain("ee"));
//    d1->add(new Domain("math"));
//    Domain* d2 = new Domain("caltech");
//    d2->add(new Domain("math"));
//    d2->add(new Domain("cs"));
//    Domain* d3 = new Domain("edu");
//    d3->add(d1);
//    d3->add(d2);
//    Domain* d4 = new Domain("com");
//    d4->add(new Domain("microsoft"));
//    d4->add(new Domain("apple"));
//    Domain* d5 = new Domain("biz");
//    Domain* root = new Domain("");
//    root->add(d3);
//    root->add(d4);
//    root->add(d5);
//    listAll(root);
//    cout << "====" << endl;
//    listAll(d2);
//    cout << "====" << endl;
//    listAll(d5);
//    delete root;
//}
//
//
//
//// For part b
////We could not solve this problem given the constraints in part a if we had only a one-parameter listAll function because our recursive call must move the return towards
////the base case each call in order to avoid an infinite recursive loop. The purpose of the second parameter is to store the previous path of the tree so that it may be
////printed out, giving us the entire domain name. Without the second parameter, we'd be unable to incrementally store the path and narrow down the recursive function to 
////the base case.