Question d’entretien chez New Relic

Write a recursive b-tree traversal algorithm counting every Nth number in the Fibinacci sequence. I did not succeed.