recursion in binary trees problem newbie

hi, im not sure what the output is in this piece of code
for the following linked list

[22]->[3]->[10]->[95]->[64]->[35]->[14]

////////////////////////////////////////////////////

typedef struct Node * Nodeptr;
struct Node {
int data;
Nodeptr Next;
};

void Process (Nodeptr X)
{
if(X != NULL) {
Process(X -> Next);
if( X -> Data % 5 == 0) {
cout<< X-> Data <<endl;
}
}
}

///////////////////////////////////////////////////////
much appreciated

Looks like it should be:
35
95
10

thanx very much, thats what i thought,