How to find node which belongs to multiple ways

I've just tried pasting a variation on the first of those into an overpass turbo window and got "Error: runtime error: […] The server is probably too busy to handle your request. ". Only if I zoom in to around 100m2 does it work - https://overpass-turbo.eu/s/KAD .

The example in the wiki helped, thank you!

Got this for now and it's showing the node I need:

[bbox:{{bbox}}];

way[highway][name="Haimhauserstraße"]->.w1;

way [highway] (around:1, 48.1624106, 11.5884358)->.w2;

node(w.w1)(w.w2);

out;

http://overpass-turbo.eu/s/KCf

At "48.1624106,11.5884358" I'm on/around the street of w2. Given this point, how is it possible to get the crossing street of w1 for the query without a constant value ("Haimhauserstraße")?

That works with the code given under the heading "If ways cannot be split into two distinct groups..." (although two ";" were missing):

way[highway]({{bbox}})->.allways;  
foreach .allways -> .currentway(  
  (.allways; - .currentway;)->.allotherways;  
  node(w.currentway)->.e;  
  node(w.allotherways)->.f;  
  node.e.f;  
  (._ ; .result;) -> .result;  
);  
.result out meta;

http://overpass-turbo.eu/s/KCR

This finds also the connection point of two road segments, though, not only strict intersections.

Thanks, that works for me!