The figure below shows part of the decision tree for Insertion Sort operating on a list of 4 numbers,a1, a2, a3, a4.

Please expand subtree T3, i.e., show all the internal (comparison) nodes and leaves in subtree T3.

Note that the left branch of a comparison (a : b) is the case a b and the right branch is a > b.

The figure below shows part of the decision tree for Insertion Sort (from page 12 of our introductory set of slides) operating on a list of 4 numbers, U1, U2, U3, U4 Please expand subtree T3, i.e., show all the internal (comparison) nodes and leaves in subtree T3. Note that the left branch of a comparison (a : b) is the case a