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

Python
1

Tell us what’s happening:

I have discovered an error, you can pass step 28 even if you input code with invalid syntax.

bst.insert(for node in nodes)

On step 45, you can add this line inside the elif block and still pass

node.key = self._min_value(node.right)

Your browser information:

User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/134.0.0.0 Safari/537.36

Challenge Information:

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

2

Thank you for helping make FCC better. Bugs can be reported as GitHub Issues. Whenever reporting a bug, please check first that there isn’t already an issue for it and provide as much detail as possible.