[Solved] Tree N Distinct Elements Min Heap Binary Search Tree Must Look Like Justify Answer 5 Poin Q37189498

I. (a) A tree with n distinct elements is both a min-heap and a binary search tree. What must it look like? Justify your answer. [5 points] 1. (b) The textbook shows sorting methods primarily to arrays. Of the following sort algorithms, which are most appropriate to sort a Singly Linked List: insertion sort, merge sort, heap sort, or quick sort? Show examples to justify your answer. [S Show transcribed image text I. (a) A tree with n distinct elements is both a min-heap and a binary search tree. What must it look like? Justify your answer. [5 points] 1. (b) The textbook shows sorting methods primarily to arrays. Of the following sort algorithms, which are most appropriate to sort a Singly Linked List: insertion sort, merge sort, heap sort, or quick sort? Show examples to justify your answer. [S

Expert Answer

---

Answer to I. (a) A tree with n distinct elements is both a min-heap and a binary search tree. What must it look like? Justify your… . . .