IDE hints and the cdo

This is pretty dumb, I must admit

What I meant is that 1 <= 100 does not constrain n in any way whatsoever.

Given a n with constrain 1<=100 - Not a strong constraint if you ask me

The definition of a leaf is 'a node with no children', so not all children are leaves.

The description says that "The rotation is changing a root of the tree to be next or previous leaf of the current root", but shouldn't it say child? In the first example the previous leaf of 9 is 8, but after rotation the new root is 7, which was originally 9's previous child.

I guess Euclidean distance would be more than clear. ;)

I would suggest that the metric by which a path is measured should be included in the description. At the moment, one could assume that all the edges have equal lengths/weights.

Brilliant!

Java translation kumited.

Aww, beat me to it. ;)

Really cool Kata! Pretty easy for computer science graduates, though. ;)