### Data Structures and Tree-Traversal Function

Trace the following tree-traversal function, f(), and describe its action: int f(tnode<int> *t) { int sLeft, sRight; if (t != NULL) { sLeft = f(t->left); sRight = f(t->right); return t->nodeValue + sLeft + sRight; } else return 0; } Please provide a complete