Write a recursive in order traversal function for a Binary Search Tree that takes the value inserted and creates a string representation as following: [ 1, 2, 3 ]. Notice the disinct spacing for the string representation. Use should have a public and private method to complete this. Def inorder(self) and Def __recursive_inorder(self, root). Complete this in python.