in reply to Re^4: Golf: Tree searching
in thread Golf: Tree searching
Well it has to handle both failure and success. However
by borrowing shamelessly from tye, I beat my previous,
and if we want to be shamelessly non-strict about it, I
can improve again.
By my count this is 53 characters.sub f { $t=pop;$t=$$t{$c>0?l:r}while$c=$$t{d}cmp$_[0]and$t;$t }
In Section
Meditations