True..

Fixed.

Okay, that's just a little typo from the author. Fixed.

That's not a issue ;-)

If you want a more demanding kata you can always create a harder version yourself. Otherwise it's up to the author to choose the input range (it'll be reflected in the kata difficulty in the end anyway).

OK, changed for better understanding.

"leaf of the current root".

In this case, leaf == child, meaning a root has children, they are leafs.

Hi @SpaceBison. No I don't like to say Euclidean because then some people might interpret that as the straight line distance directly from spider to fly. Instead I have just clarified the requirement by adding another Kata description note. Thanks.

It is simply a question about distance - not the number of edges.

If I said shortest length path would that remove the ambiguity?

Not really. Just logic. :D

Yes, I instantly recognized what this function is by looking at the descriptions. It's too easy for people familiar with CS stuff ;-)

help me senpai

Approved

@marko-bekhta. You can fix it like this:
Node node1 = new Node();
node1.value = 2;
Your node1 object will now have a value of 2. Should have been mentioned in the description though.

there's something wrong with the Smaple tests ... maybe this can be fixed ?

/home/codewarrior/src/main/java/SolutionTest.java:10: error: constructor Node in class Node cannot be applied to given types;
Node node1 = new Node(1);

The preloaded method oneTwo() actually returns the solution.

Sorry. I need to spend more time to review translations. I've fixed description and oneTwo in Java