# Terminology for tree-like proofs

In a tree-like proof what is the term for the number of steps between any node and the root (the statement proved by the proof)? That is, if numb were this term, then one would have depth of tree = max(numb(leaf)), where the max is taken over all leaves in the tree.

• I would just call it the depth of a node, personally. Although I have no idea whether that's convention. – Arthur Apr 22 at 8:42
• OK thanks. In googling I see at least some people use that term, so I guess I will use it. – abo Apr 22 at 10:07