Which XXX completes the BST search algorithm? def bstsearch(tree, key): cur = while cur: if key == : return cur elif XXX: cur = else: cur = return None