I'm solving a problem called number of smaller elements on the right side of an array. I saw stl solution based on the set they've used "distance(s.begin(), it)" I know how distance fn works on linear data structure but I don't know how it goes with a hierarchal structure like a set, etc.. Do you have an idea about how it works on trees?