If it's prerequisite relationship, you need to make sure that when A points to B, and B points to C, C doesn't point to A. Otherwise you're creating a loop.
Right, it must be acyclic. Which means it can be presented as a tree with some duplicate nodes. The important thing is the student must understand in which order they can try to understand the topics.
It may be a tree. But it must be a DAG (directed acyclic graph).