| delete(BinarySearchTree.Node, Comparable) |  | 100% | | 100% | 0 | 6 | 0 | 20 | 0 | 1 |
| insert(BinarySearchTree.Node, Comparable, Object) | | 100% | | 100% | 0 | 4 | 0 | 10 | 0 | 1 |
| floorEntry(Comparable) | | 100% | | 100% | 0 | 5 | 0 | 12 | 0 | 1 |
| findNode(BinarySearchTree.Node, Comparable) | | 100% | | 100% | 0 | 4 | 0 | 9 | 0 | 1 |
| inOrder(BinarySearchTree.Node, List) | | 100% | | 100% | 0 | 2 | 0 | 6 | 0 | 1 |
| height(BinarySearchTree.Node) | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| get(Comparable) | | 100% | | 100% | 0 | 2 | 0 | 2 | 0 | 1 |
| inOrderKeys() | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| contains(Comparable) | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| insert(Comparable, Object) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| min(BinarySearchTree.Node) | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| delete(Comparable) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| isEmpty() | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| height() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| BinarySearchTree() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| size() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |