N-ary tree - mirror

I've given a n-ary tree in .txt file, where first integer is parent and the next ones are child of it:

 
1 2 3 4 5
3 6 7
5 8
8 9 10 11 
0 (represents the end of the tree)

And, it could also be written like this (same tree):

My task is to output result as (First example):

I'm really desperate to find a solution here and I my brains are slowly giving up. I've a function to read from .txt file and put all the values in the array. (I know that I shouldn't use EOF, but atm, that's not the problem we should focus on..)

How can I correctly make a tree and get the correct output?

 
const int MAX_CHILD = 100;

struct TreeNode {
 int val;
 TreeNode *children[MAX_CHILD];
 TreeNode(int x) : val(x) {
     for(int i = 0; i < MAX_CHILD; ++i) {
         children[i] = nullptr;
     }
 }
 };
 Node *newNode(int val)
{
TreeNode *temp = new TreeNode;
temp->val= val;
return temp;
}


TreeNode* invertTree(TreeNode* root) {
if(!root) {
    return root;
}


for(int i = 0; i < MAX_CHILD; ++i) {
    invertTree(children[i]);
}

// reverse the children nodes array
for(int left = 0, right = MAX_CHILD - 1; left < right; left++, right--) {
    swap(children[left], children[right]);
}

return root;
}

int main()
{
    ifstream file("Alise.in.txt");
    int linecount = 0;
    int tempArray[100];
    int *finalArray;
    // Bad practise - I know. I believe it doesn't hurt atm, as I've more srs problem
    while (!file.eof())
    {
        file >> tempArray[linecount];
        linecount++;
    }
    linecount = linecount - 1; // Skip the last integer on file '0'

    finalArray = new int[linecount];
    for (int i = 0; i < linecount; i++)
    {
        finalArray[i] = tempArray[i];
    }
    // Print the array.
    for (int i = 0; i < linecount; i++)
    {
        newNode(finalArray[i]); // Putting in values and making tree
    }
    delete[] finalArray;

return 0;
}

Chidoro (10)

My task is to output result as (First example) :

How is that a tree?

Maartin (26)

@Chidoro

1 is root (have to check it tho - not sure how, cuz tree can be given with second example).
rest of the numbers are child of 1.
Repeat with each line and you get (left picture):
https://img.exs.lv/e/z/ezeliitis/image001.jpg

Last edited on

Chidoro (10)

What are the original details of your assignment?

Maartin (26)

Task: Computer understands tree, if it's structure is: every line contains information about inside node (not a leaf); On every line - first integer is node and the next ones are childrens. Tree can be structured differently, for instance: .txt file

AS WELL AS:

It's mandatory to output tree's inside nodes in pre-order, first comes parent, then child information. Nodes in the tree can be up to 100. What I need to do? - output the tree in mirror style.

EXAMPLE 1: (Input - preorder sequence):

Input data from Example.in.txt file: