Answer:
True.
Step-by-step explanation:
In the tree data structure the edges are unidirectional as their direction is from parent to child.If you are iterating on the tree you cannot move backward in the tree that is from child to parent.That's why recursion is preferred for tree because you can backtrack in recursion very easily.
Hence the answer is true.Edges are unidirectional in the tree data structure.