Answer:
True
Explanation:
Recursion is a powerful programming paradigm for solving problems which can be restated as a combination of subproblems of the same type. Some common examples include:
1) factorial(n) = n* factorial(n-1);
Here factorial of a number is expressed as a product of the number and the factorial of the number decremented by 1.
2) treesearch(node,value)) = treesearch(left,value) || treesearch(right,value)|| (root==value)
Here we are searching for a value in a tree. This can be expressed recursively as a boolean OR of search result on left and right subtrees and the search result for the root of the tree.
