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

Python
1

Tell us what’s happening:

Please help! Followed instructions, but doesn’t pass. What am I missing?

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

# User Editable Region


    def _insert(self, node, key):
        if node is None:
            return TreeNode(key)
        if key < node.key:
            #left = self._insert(node.left, key)
            #self.left = self._insert(node.left, key)
            left._insert = self._insert(node.left, 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/141.0.0.0 Safari/537.36

Challenge Information:

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

2

are you assigning the result to the left attribute of the current node?

4

I have tried three options and none of them pass.
How do I assign the result to the left attribute of the current node?
Which is left attribute of the current node? Instructions say it is “left”.

5

Hi @70N10

You need to reference the iterator.

The second hashed out code is nearly correct.

Happy coding