Implementation of a round-robin style of managing which player has the next turn

ID: 3556868 • Letter: I

Question

Implementation of a round-robin style of managing which player has the next turn in a board game. Round-robin is defined by beginning with one starting player, then cycling through all other players exactly once before returning to the starting player. After a player has taken his or her turn, that player moves to the end of the line.

List

Stack

Queue

Deque

Binary tree

Binary search tree

B tree

HashMap

HashSet

Priority Queue

Graph