Create a tree class

root = { }

T.root // return root
T.isRoot // true false if is root
T.Size // size of the tree
T.isLeaf // If the node has no children is true

Make a linked list that allows storage of a bunch of values with some repeating without lots of overhead
I.E: 0,0,0,0,0,0,5,0,0,0,0,3,0,0,0,0,6,0,0,0,0

Write a program, using trees, that plays tick tack toe.
The tree will be populated with every possible outcome of the game and calculate the best move from there.
Leaf nodes will be scored depending on a win or lose or draw, or neither.

• Write Queue class with:

-size
-max
-front

enqueue() //Add to back
dequeue() // pop from front
front() inspect front
back() //inspect back

• Use Queue class to simulate:

1000 shoppers, 10 queues
1-5 min to checkout
every 2 min shopper is ready to checkout
Make 3 different queuing strats:

• Random Queue
• Join shortest Queue
• Staging queue