Jesse Pope - CS Fun Tree Practice #37
Conversation
|
Grabbing this to grade! |
| else: | ||
| current_root.right = self.add_helper(current_root.right, new_node) | ||
|
|
||
| return current_root |
There was a problem hiding this comment.
This implementation of add_helper works, but definitely does a bit of extra work in setting nodes. Essentially, every node on the path to where the new node ends up will have either its left or right node "updated", though most of these will be updated to the exact same node. The only one that gets a meaningful update is whenever the bottom of the tree is reached and gets its left/right node updated to the new node. These updates happen in lines 20 and 23.
This probably will not be too bad of a performance hit, but there is a way that you can do this and just update only the node you need.
But this overall fine enough!
| return | ||
|
|
||
| new_node = TreeNode(key, value) | ||
| self.add_helper(self.root, new_node) |
There was a problem hiding this comment.
Looks like this was an older recursive solution. Good on you for solving it both ways! And correctly at that!
However, do be careful about leaving old unused versions of code in your source code, whether they are commented out or not. Especially if they have have the same name as they do in this case. Just mainly a style thing about aiming to keep your code clean of clutter.
No description provided.