Greetings all, We did another Parrot benchmarking, this time using a common programming technique: recursion. We created a function to calculate the number of nodes in a full binary tree given the tree's height. I guess this time the results where not so satisfactory, for Parrot. You can see the details here: http://use.perl.org/~smash/journal/36140
./smash
