The ADT specifies we must include a "size" method that returns a count of the number of elements in the BST.
We have two choices:
- Traverse the tree and count
- Keep track of "size" as a sub-component (ivar)
With option #2, the size method will perform at O(1) compared to O(n) for option #1. We choose option #2.