The run-time stack is a structure that keeps track of the activation records at

Question

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. 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. Quick sort should NOT use when the data is almost sorted. Quick sort is always quick. Merge sort requires extra space. Selection sort recognizes if the values are already sorted. Binary searching is always faster than linear searching. HeapSort is inherently unstable.

Explanation / Answer

1. True
2. False
3. True
4. True
5. False
6. True
7. False
8. False
9. True
10. True
11. True
12. True

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

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