Write a program that find and print how many odd numbers in a binary tree
struct node { int data; struct node *l; struct node *r; }; typedef struct node *n; int oddnos(n root) { static int count; n cur = root; if(cur!=NULL) { if(cur->data%2==1) count++; oddnos(root->l); oddnos(root->r); } return count; }