Linked Lists for Research Trees?
I want to implement a reasearch tree into a program that I'm writting right now. However, what would be the best way to do such a thing?
Maybe a modified version of a linked list?
RESEARCHX needs only two previous types of research completed before it can be researched whereas RESEARCHY needs 3. The idea is to make the tree flexible enough that I can have any number of 'modules' complete before the next ones can be complete.
} -- RESEARCHX --
RESEARCH2 -- \
} -- RESEARCH Z
RESEARCH3 -- /
RESEARCH4 -- } -- RESEARCHY --
I hope that this is clear...