# Python Program to Sort using a Binary Search Tree class BSTNode:    def __init__(self, key):        self.key = key        self.left = None        self.right = None        self.parent = None     def insert(self, node):        if self.key > node.key:            if self.left is None:                self.left = node                node.parent = self            else:                self.left.insert(node)        elif self.key <= node.key:            if self.right is None:                self.right = node                node.parent = self            else:                self.right.insert(node)     def inorder(self):        if self.left is not None:            self.left.inorder()        print(self.key, end=' ')        if self.right is not None:            self.right.inorder()  class BSTree:    def __init__(self):        self.root = None     def inorder(self):        if self.root is not None:            self.root.inorder()     def add(self, key):        new_node = BSTNode(key)        if self.root is None:            self.root = new_node        else:            self.root.insert(new_node)  bstree = BSTree() alist = input('Enter the list of numbers: ').split()alist = [int(x) for x in alist]for x in alist:    bstree.add(x)print('Sorted list: ', end='')bstree.inorder()