Return the depth of this expression tree as a measure of its complexity. For binary operations, we precompute the depth when we construct the node as the maximum of the left and right depths, plus one.
()
Source from the content-addressed store, hash-verified