class Solution {
public:
int countNodes(TreeNode* root) {
if(!root) return 0;
else if(!root->left) return 1;
else if(!root->right) return 2;
return countNodes(root->left) + countNodes(root->right) + 1;
}
};
class Solution {
public:
int trainWays(int num) {
int j = 1;
int k = 1;
int n;
for(int i = 1;i<num;i++)
{
n = (j+k)%1000000007;
j = k;
k = n;
}
return k;
}
};