A. Create a class Node to initialize the left and right pointers in the constructor 1. Add a constructor of the class that takes one argument data in order to set the elements for the tree. The constructor should also initialize left and right node pointers class Node: _init__(self, data): 17 your code goes here def B. Create a class BST and implement the following functions. 1. Add a constructor of the class that initializes the root pointer. class BST: def init__(self): 1 your code goes here 2. Add a function Insert() which inserts a node in the tree recursively. def Insert (self, value) : // your code goes here 3. Add a function PreOrder() which returns a List of elements in the tree. def PreOrder (self): // your code goes here 4. Add a function InOrder() which returns a List of elements in the tree. def InOrder (self): 1/ your code goes here 5. Add a function PostOrder() which returns a List of elements in the tree. def Postorder (self): // your code goes here 6. Add a function Height() which returns the height of the tree. def Height (self): // your code goes here 7. Add a function Find Min() which returns the minimum element of the tree. def FindMin (self): // your code goes here 8. Add a function FindMax() which returns the maximum element of the tree. def FindMax (self): // your code goes here 9. Add a function Successor() which returns the successor of an element in the tree. i.e. Minimum value in the right subtree. def Successor (self): // your code goes here 10. Add a function Predecessor() which returns the predecessor of an element in the tree. i.e. Maximum value in the left subtree. def Predecessor (self): // your code goes here 11. Add a function Delete() which deletes a node from the tree. def Delete (self, value): // your code goes here