For a link-based bag, the most convenient place to make an insertion is at the beginning of the chain.

True

False

Generally speaking, a link-based implementation does not impose a fixed maximum size on the data structure.

True

False

Given the following method from the class LinkedBag What does this method do?

template bool LinkedBag::doSomething(const ItemType& anEntry) const { return (getPointerTo(anEntry) != nullptr); }

returns true if the LinkedBag contains anEntry

Frees all memory in free space used by the Linked Bag

sets the current node to anEntry

returns true if the LinkedBag is empty

In a link-based implementation, what node is the only one to which we have direct access?

The tail

The one at nullPtr

All are equally direct access

The head

The LinkedBag method clear() cannot simply set itemCount to zero.

True

False