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

Python
1

Tell us what’s happening:

Hi, can anyone help me how to fix my codes? I don’t understand. Thanks!

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, 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 insert(self, key):
        self.root = self._insert(self.root, key)
        

# User Editable Region

    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 search(self, key):
        self._search(self.root, key)
        result = self._search()
        return result


# 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/126.0.0.0 Safari/537.36 Edg/126.0.0.0

Challenge Information:

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

2

Please talk to use about how exactly the instructions are confusing (without copy-pasting the instructions at us). Thanks

3

dont overthink the return. remember its asking you to return basically what you all ready created so return that line simple as possible! no need to create a new line to return what it wants!