They showed me a "DAG" (Directed Acyclic Graph) and told me that it was a "tree". Trees are un-directed graphs, thus that graph could not be a tree, but you should probably just nod, since they might get offended.