Python3 Binary Search Tree

I have already created class and defined functions.

Plz help me with the code of these functions.

class TreeNode: def init (self, key, data-None, left-None. right-None) : self.key -key self.data-data self.leftleft self.right right class BinarySearchTree: Returns empty BST def init (self) self.root None #returns True if tree is empty, else False def is empty (selt) pass # returns True if key is in a node of the tree, else False def search(self, key) : pass # inserts new node w/ key and data def insert (selE, key, data-None) : On Insert, can assune key not already in 85 Example node creations temp Treelode key, data pass deletes node containing key-can assume the node exists def delete(self, key) s WILL need to consder all cases- ikely want helper funetlons like find uccessorn and splice-out() pass returna node with min key in the . can assume at least one node in BST def find min(self) pass returns node with max key In the B7-can assume at least one node In BST def find max (selE) pass return Python 1ist of BST keys representing inorder traversal of BS def inorder list (self) pass return Python list of BST keys representing preorder traversal of B def preorder list (self) pass return the height of the tree def tree height (self) pass