The running time analysis in problem 3.14 probably indicates that merging on the tree is no faster than procedure SEQUENTIAL MERGE. Show how merging on the tree can be more appealing than sequential...

The running time analysis in problem 3.14 probably indicates that merging on the tree is no faster than procedure SEQUENTIAL MERGE. Show how merging on the tree can be more appealing than sequential merging when several pairs of sequences are queued for merging.