Leetcode 1902. Depth of BST Given Insertion Order

Given a sequence of distinct keys inserted into an empty binary search tree, compute the final tree's maximum depth (height). The challenge is to determine each insertion's depth from the order efficiently (i.e., better than the naive O(n^2) approach), typically by exploiting predecessor/successor relationships in the already-inserted keys.