Recursion Programming Exercise: Add odd positions

(function(){ window.OpenPopKa = true;}())

For function "addodd", write the missing recursive call. This function should return the sum of all positive odd numbers less than or equal to "n".
int addodd(int n) { if (n <= 0) { return 0; } if (n % 2 != 0) { // Odd value return <<Missing a Recursive call>> } else { // Even value return addodd(n - 1); } }

[editor.getValue()]

if (guess[0] != initEditor) { console.log(guess[0]); window.codeValue = guess[0]; window.progexType = "RecurTutor"; window.summexName = "RecCAddoddPROG"; } else { return ""; }

When n is odd, accumlate n's value to whatever will be returned from the recursive call.