Tell us what’s happening:
I have tried everything and the only answer is that I must have a formatt error but I cant seem to find it and continue: This is the error i get:Traceback (most recent call last):
File “main.py”, line 47, in
File “https://www.freecodecamp.org/js/workers/
1.0.1/python-worker.js”, line 1, in Object.print
File “https://www.freecodecamp.org/js/workers/
1.0.1/python-worker.js”, line 1, in ???
str_returned non-string (type Non
TypeError:
eType)
Your code so far
class TreeNode:
def __init__(self, key):
self.key = key
self.left = None
self.right = None
# User Editable Region
def __str__(self):
pass
# User Editable Region
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)
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):
return self._search(self.root, key)
bst = BinarySearchTree()
nodes = [50, 30, 20, 40, 70, 60, 80]
for node in nodes:
bst.insert(node)
print('Search for 80:', bst.search(80))
Your browser information:
User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/152.0.0.0 Safari/537.36
Challenge Information:
Learn Tree Traversal by Building a Binary Search Tree - Step 30