USE PYTHON Language

# TODO: implement this method! def items(self) -) List [Any]: ""Return all of the items in the BST in sorted order. You should *not* need to sort the List yourself: instead, use the BST property and combine self._left.items() and self._right.items() in the right order! >>> BinarySearchTree(None).items() # An empty BST >bst BinarySearchTree(7) left = BinarySearchTree(3) >>> left-left BinarySearchTree(2) >> left._right - BinarySearchTree(5) >> right - BinarySearchTree (11) >>> right-left = BinarySearchTree (9) >>> right-right = BinarySearchTree (13) >bst. leftleft >>> bst. rightright >bst.items() [2, 3, 5, 7, 9, 11, 13 pass