Symbols have depth 1:

Additional levels of nesting increase the depth:

Only the deepest part of the expression affects the depth:

Depth can work with any expression:

Use TreeForm to visualize depth as the number of levels of the expression:

Find how deeply nested results from integrals are:

Find the depths of combinator expressions [more info]:

Considering the heads increases the depth:

Increase the nesting level of the combinator expressions:

Depth generally gives the length of the maximum index, plus 1:

Verify the equality:

Depth considers the deepest part of an expression:

ArrayDepth only considers the levels to which the expression is completely rectangular:

For completely rectangular expressions, Depth gives a result one greater than ArrayDepth :

Depth [expr] is the smallest positive level k for which Level [expr,{k}] returns an empty list:

If length-0 functions or compound heads are present, both Depth and Level must use Heads True :

Successive elements from NestList have larger depths:

Depth returns a depth one greater than that returned by ArrayDepth :

Depth counts an association as a single level:

It counts the corresponding list of rules as two levels:

The relationship between Depth and Position can break down when compound heads are present:

Set Heads True in Depth to restore the relationship: