Algorithm: Search. If less, go left; if greater, go right; if equal, search hit. Insert. If less, go left; if greater, go right; if null, insert. Get. Return value corresponding to given key, or null if no such key. Put. Associate value with key.
Complexity:
Order operation and deletion: Look at slides.
