The base case in a recursive algorithm is the one where the recursive expression

Question

The base case in a recursive algorithm is the one where the recursive expression(s) occur. If the statement alpha = Max(a, Max(b, c)) appears in the body of the main function, then this statement is an example of a recursive function call. A recursive function must always contain both a base case and a general case although the base case may be empty. Deleting a node in a binary tree always reduces the number of levels in the tree. Insertion order determines the shape of a binary search tree. A binary search tree does not need a copy constructor. The maximum number of nodes that can be on level N is 2^N (root is level 0). The run-time stack is a structure that keeps track of the activation records at run-time. In general. a recursive solution to a problem is more memory efficient than an iterative solution. Tail recursion often indicates that the problem could be solved more efficiently using iteration. Briefly answer the following questions. When is it good to use recursion? What are stored on an activation record?

Explanation / Answer

Solution:

· 1. Locals to the callee

· 2. Return address to the caller

· 3. Parameters of the callee

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.