tree = empty_bst()

 for value in [1, 2, 3, 4, 5]: # already sorted input
   tree = insert(tree, value)
 # every node has only a right child -- the tree is really a linked list
 # search is now O(n), not O(log n)
