The implementation of setTypeAnnotationPositions will iterate over N type annotations N times, looking for a specific tree position. This is O(N^2). The implementation should use a hash table or similar structure to reduce running times to O(N).