A tree is a special case of a more general structure called a directed graph. A graph has nodes, which in the context of graph theory are usually called vertices, and arrows, which in this context are called edges. Note that this usage of the word “graph” has no relation at all to the graph of a function. There are also undirected graphs, where the edges that connect vertices don’t have a preferred direction. We’ll discuss graphs more later.