No, I'm not talking about Treebeard. Rather, I'm talking about characters that can be used to represent tree structures, especially directories and files in directory structures.
In graph theory, a tree graph a tree is an undirected graph in which any two vertices (nodes like directories and files) are connected by exactly one (1..1) path, or equivalently a connnected acyclic undirected graph. The connections are edges (aka links or lines).
The examples below will represent the following tree (listed in alphabetical order):
root/