A program that will manage cards for a card game. All cards have a suit and a rank, which can be used to determine the value of cards in relation to each other. All cards will be managed by a Binary Search Tree (BST) where the best card is the maximum and the worst card is the minimum.
-
Notifications
You must be signed in to change notification settings - Fork 0
Defining classes in Python Overloading the ==, <, and > operators in a Python class Implementing and applying the Binary Search Tree (BST) data structure with duplicate values Writing functions that ensure Card objects are in sorted order
ashleyson/goFish
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Defining classes in Python Overloading the ==, <, and > operators in a Python class Implementing and applying the Binary Search Tree (BST) data structure with duplicate values Writing functions that ensure Card objects are in sorted order
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published