On: Algorithmic Thinking (2nd Edition)

[defrost]

> A tree is a special case of a graph where every node has exactly one relationship with its parent.

Is a triangle a tree, a graph where every node has one parent and one child then?

[duped → defrost]

No, since it's undirected every node has two parents

[defrost → duped]

perhaps you should amend your amendment to make directed graph clear ?

Does that solve your problem?

[duped → defrost]

I intentionally omitted direction from the description to avoid pedantry, because the problem I was highlighting was that "interconnected trees" is very wrong.