Gets the value corresponding to the given key.
Since a Tree is automatically balanced as key/value pairs are added, key lookup is O(log n) ( where n is the number of key/value pairs in the tree).
| this |
a Tree |
| key |
the key to look up |
|
the value corresponding to the key, or null if the key was not found |