- Exam 1 Summer 2015 B Write A Method That Uses A Circular Linked List To Implement A Basic Card Game The Circular Linke 1 (38.31 KiB) Viewed 20 times
Exam 1 Summer 2015 b. Write a method that uses a circular linked list to implement a basic card game. The circular linked list represents the list of players. Each "round" cards are dealt to each player. Whoever has the lowest numerical value loses and is removed from the game. (Kings, queens, etc are not part of this, just cards 1-10). If there is a tie, the entire round is played again. The last player remaining wins. You may assume that there will never be more than 6 players, you may not assume a minimum number of players (hint: error check!). (15 points) Assume you have the following classes: Circular Linked List 1) create list 2)input Players int getSize(); . bool isEmpty(); bool insert (int players, int& location); bool remove (int players); int dealCard(); +3) Check list Node a) Print Winter 4) count Players int data; Node next; int playCardGame (int numOf Players) • bao! insock(int PIC. 5) Deal cards-Deakoul( 6) Start Game Check $1 eplay if the remou loser