We track the depth of btree each time we do the search:

    /* Track how deep the tree gets. */
    if (depth > btree->maximum_depth)
        btree->maximum_depth = depth;

This is performance critical code and we should not do this here. Instead, we can do this when each time root page is split or reverse split as WiredTiger only changes the depth when root page is split or reverse split.