1The operation that inserts an element after the tail of a list is called a remove b append 2 Most of the operations on a linked implementation of a positional list run in a Constant time b Linear...

1The operation that inserts an element after the tail of a list is called

a remove

b append

2 Most of the operations on a linked implementation of a positional list

run in

a Constant time

b Linear time

3 The insert and remove operations on an array-based indexed list run in

a Constant time

b Linear time

4 The positional list operation next has

a No preconditions

b One precondition—that hasNext returns True