Implement a binary search tree class BST with insert(value), contains(value), and inorder() methods. inorder() returns all values in sorted ascending order.