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

Python
1

Tell us what’s happening:

It is asking me to call the _insert method on the left child of the current node. Then, assign the result to the left attribute of the current node but I cannot figure out the correct syntax to save my life.

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 = _insert(node.left, node.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

Challenge Information:

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

2

You are close. Some changes are needed to make sure _insert method is called on specific instance, and to use the method parameters. After attempting to submit your code, hint is giving more precisely which pieces should be used in code.

3

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