This question tests your understanding of decision trees. Yo…
This question tests your understanding of decision trees. You can draw the portion of the decision tree for insertion sort on 5 elements (a1, a2, a3, a4, a5) to the leaf node annotated by the permutation . Each of the following sub-questions asks you about the element-wise comparisons made at the k-th node from the root node to the given leaf node, where the 1-st node denotes the root node. The comparison at the root node (first node) is “a1 > a2?” (a) What is the comparison made at the 2nd node from the root to the leaf node annotated by the permutation ? [a] (b) What is the comparison made at the 3rd node from the root to the leaf node annotated by the permutation ? [b] (c) What is the comparison made at the 5th node from the root to the leaf node annotated by the permutation ? [c] (d) What is the comparison made at the 7th node from the root to the leaf node annotated by the permutation ? [d]
Read Details