Question

1. What kind of recursive function is this?

void assignment(int x)

    {

print("*");

if (x > 1)

        {

            assignment(x / 2);

            assignment(x / 2);

        }

    }

A. Tail and non-tail recursion

B. Tail recursion

C. Non-tail recursion

D. N/A

Answer 1

The answer is D.)N/A

Explanation: The above function is tree recursive, it means that the function calling itself more than once. To be more specific the function is binary recursive i.e, the function called itself two times.

Function with two recursive calls are referred to as binary recursive functions. And this recursive calls forms a tree, therefore we can call them as tree recursive.