Question

Disregarding any references or pointers in data elements, i.e., the info components, how many null pointers are there in a properly maintained circular linked list that is not empty

Answer 1

Answer:

There are no null pointers.

Explanation:

Each element in a circular linked list points to exactly one other element, thus closing the loop and making it "circular".