Learn Tree Traversal by Building a Binary Search Tree - Step 20

Is there something missing in the method call to get the following error?

"Sorry, your code does not pass. Keep trying.

You should call the _search method within the search method."

Your code so far

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


# User Editable Region

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

# User Editable Region

Your browser information:

User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/120.0.0.0 Safari/537.36 Edg/120.0.0.0

Challenge Information:

Learn Tree Traversal by Building a Binary Search Tree - Step 20

before _search u need to add self

see similar type solution.

above is for _delete

2 Likes

Thank, now I’ll know what to do when I get to that step.