write a python program for following:

finding the successor in a binary search tree:

-> self contains key,left right, parent

def successor(self, node=None):

"""Return successor of the given node.

The successor of a node is the node with the next greater key.

Return None if there is no such node.

If the argument is None, return the node with the smallest key.

"""

#: Implement