MirrorOfGenricTree.cpp

#include <bits/stdc++.h>
using namespace std;

// https://www.geeksforgeeks.org/mirror-of-n-ary-tree/

class Node

{

public:
    int data = 0;

    vector<Node *> children;

    Node(int data)

    {

        this->data = data;
    }
};

void display(Node *node)
{
    string s = "";
    s += to_string(node->data) + " -> ";
    for (Node *child : node->children)
    {
        s += to_string(child->data) + ", ";
    }

    cout << s << "." << endl;

    for (Node *child : node->children)
    {
        display(child);
    }
}

Node *constructor01(vector<int> &arr)

{

    if (arr.size() == 0)

        return NULL;

    vector<Node *> stack;

    stack.push_back(new Node(arr[0]));

    Node *root = stack[0];

    for (int i = 1; i < arr.size(); i++)

    {

        if (arr[i] != -1)

        {

            Node *node = stack.back();

            Node *nnode = new Node(arr[i]);

            node->children.push_back(nnode);

            stack.push_back(nnode);
        }

        else

            stack.pop_back();
    }

    return root;
}

void mirrorTransform(Node *node)
{

    for (Node *child : node->children)
    {
        mirrorTransform(child);
    }

    //   reverse(node->children);
    for (int i = 0, j = node->children.size() - 1; i < j; i++, j--)
    {
        Node *temp = node->children[i];
        node->children[i] = node->children[j];
        node->children[j] = temp;
    }
}

void solve()
{
    int n;
    cin >> n;
    vector<int> arr(n);
    for (int i = 0; i < n; i++)
    {
        cin >> arr[i];
    }
    // construct class for creating tree
    Node *root = constructor01(arr);

    // displaying Genric tree
    cout << "Created Genric Tree";
    cout << endl;
    display(root);
    cout << endl;

    // class to find mirror of the genric tree
    mirrorTransform(root);

    // displaying mirror of the genric tree
    cout << "Mirrored Genric Tree";
    cout << endl;
    display(root);
}

int main()
{
    // solve class
    solve();
    return 0;
}