A normal queue, if implemented using an array of size MAX....SIZE, gets full when. A. Rear = MAX....SIZE - 1. B. Front = (rear + 1)mod MAX....SIZE. C ...
確定! 回上一頁