1. Count nodes #

Created Saturday 01 February 2020

f(root) = 1 + f(root->left) + f(root->right); 0 if root is nULL;