Tree with n amount of child
Hello.
I'm looking for some ideas how to implement something like this:
(I am not allowed to use most of already existing libs!)
http://prntscr.com/9ijnxn
So yea, i do know how many roots these "Trees" have.
So far my idea is to create a struct which holds the roots of the trees.
The thing that confuses me is that each parent has n amount of childs. I guess i could fix this by adding a linked list to each parent and then just adding nodes to it. The other thing that confuses me is that 2nd trees root points to a child in the 1st tree... IF anyone could explain me a simple idea how to implement this without using libs(except for iostream) it would be great. Thanks.
I'm looking for some ideas how to implement something like this:
(I am not allowed to use most of already existing libs!)
http://prntscr.com/9ijnxn
So yea, i do know how many roots these "Trees" have.
So far my idea is to create a struct which holds the roots of the trees.
The thing that confuses me is that each parent has n amount of childs. I guess i could fix this by adding a linked list to each parent and then just adding nodes to it. The other thing that confuses me is that 2nd trees root points to a child in the 1st tree... IF anyone could explain me a simple idea how to implement this without using libs(except for iostream) it would be great. Thanks.
Topic archived. No new replies allowed.