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

Python
1

Tell us what’s happening:

hi, can anyone help me? I don’t understand the command and how to fix my codes now?

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)

# 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 12

2

Hi @Yuxiao

Assign the result to the left attribute of the current node.

The assignment needs to go to the current node.

Happy coding

3

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