python/exercises/practice/binary-search-tree/binary_search_tree.py

class TreeNode:
    def __init__(self, data, left=None, right=None):
        self.data = None
        self.left = None
        self.right = None

    def __str__(self):
        return f'TreeNode(data={self.data}, left={self.left}, right={self.right})'


class BinarySearchTree:
    def __init__(self, tree_data):
        pass

    def data(self):
        pass

    def sorted_data(self):
        pass