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

Tell us what’s happening:

I cannot understand where is the problem so far?

I tried to change the indentation but still not giving me the pass

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)


/* User Editable Region */

    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
        pass
                       

/* 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

Challenge Information:

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

The return should be indented the same amount as the conditionals.

Also, I don’t know where the pass thing is coming from.

This topic was automatically closed 182 days after the last reply. New replies are no longer allowed.