How can I make a tree with n number of child nodes?

Question

Usually they have only two, but I need to make an object were there are a random number of pointers. To represent this image enter image description here

Using what I know I made this:

struct tree{
    string name;
    list<struct pointer> pointers,

    tree(int x){
        name= x;
        pnext=null;
    }
} root1;

struct pointer{
    struct tree *pnext;
};

A tree or object with a list of pointers and the structure for the pointers, but I doesn´t seem right. How can I make a tree with a random number of pointers? (I should say what is wrong with but I don´t een know were to start, sorry)

You can have a `std::vector>` in each node that represents the n children. — NathanOliver, Jun 08 '17 at 16:02
Read one of [these textbooks on C++](https://stackoverflow.com/questions/388242/the-definitive-c-book-guide-and-list) — Passer By, Jun 08 '17 at 16:02
`but I doesn´t seem right` Why not? Seems just fine to me (except I would not use `std::list` unless there is a good reason to do so). Why do you want *"random number of pointers"*? — eerorika, Jun 08 '17 at 16:21
user2079303, because in the image one node is linked to one, two or for other child nodes. — jose carranza, Jun 08 '17 at 16:24
You could just as well have one pointer to an array of children. — eerorika, Jun 08 '17 at 16:26

score 0 · Accepted Answer · answered Jun 08 '17 at 16:38

try this:

#include <vector>

struct person {
    string name;

    vector<person> children;

    person(string iName, vector<person> iChildren) {
        name = iName;
        children = iChildren;
    }
}

This way, each person has a name, and a vector with all of it's children in it.

How can I make a tree with n number of child nodes?

1 Answers1