# Learn Tree Traversal by Building a Binary Search Tree - Step 38

### Tell us what’s happening:

Hi! I am really struggling with the last line. What am I doing wrong? It seems I have tried everything.

``````class TreeNode:
def __init__(self, key):
self.key = key
self.left = None
self.right = None

class BinarySearchTree:
def __init__(self):
self.root = None

def insert(self,key):
self.root = self._insert(self.root, key)

def _insert(self, node, key):
if node is None:
return TreeNode(key)
if key < node.key:
node.left = self._insert(node.left, key)
elif key > node.key:
node.right = self._insert(node.right, key)
return node

def search(self, key):
return self._search(self.root, key)

def _search(self, node, key):
if node is None or node.key == key:
return node
if key < node.key:
return self._search(node.left, key)
return self._search(node.right, key)

def delete(self, key):
self.root = self._delete(self.root, key)

def _delete(self, node, key):
if node is None:
return node
if key < node.key:
node.left = self._delete(node.left, key)
elif key > node.key:
node.right = self._delete(node.right, key)
else:
if node.left is None:
return node.right
elif node.right is None:
return node.left

# User Editable Region

node.key = self._min_value(node.right)
self._delete(node.right, node.key)

# User Editable Region

``````

User Agent is: `Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/115.0.0.0 Safari/537.36`
You should assign the return value of the `_delete()` call to the right child of the current node.