Unfolding kdtree ...  ok.
Find NN for p=[ -1 [ 6 4 ] ]
L1 nn  : [ 0 [ 5 4 ] ]
L1 dist: 1