  The depth of a link measures the minimum height of a resolving tree for the
link whose leaves are all unlinks. We show that the depth of the closure of a
strictly positive braid word is the length of the word minus the number of
distinct letters.
