... as good as (a) (Comparing (c) to (b) is easy, but it is less obvious how to compare (c) and (b) to (a) (c) and (b) are asymptotically at least as good as (a) because n, i lg i, and i lg n are ... cn i D1 n X ci3i C cn i D1 c n X i3 i Cn ! iD1 n n3 3n D c 2 C Cn 3 1/2 3n n D cn3 Cc Cn c D cn3n C 2n C 3n / cn3n for all c > 0, n (see below) Selected Solutions for Chapter ... change to point to them, and so on Since there are n nodes, this change would cause insertion to create .n/ new nodes and to take .n/ time e From parts (a) and (c), we know that insertion into...