Added code to merge two trees - #4121
Conversation
ghost
left a comment
There was a problem hiding this comment.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.
algorithms-keeper commands and options
algorithms-keeper actions can be triggered by commenting on this PR:
@algorithms-keeper reviewto trigger the checks for only added pull request files@algorithms-keeper review-allto trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.
There was a problem hiding this comment.
Please provide return type hint for the function: __init__. If the function does not return a value, please provide the type hint as: def function() -> None:
Please provide type hint for the parameter: value
Please provide type hint for the parameter: left
Please provide type hint for the parameter: right
| self.right = right | ||
|
|
||
|
|
||
| def merge_two_binary_trees(tree1: Node, tree2: Node) -> Node: |
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file data_structures/binary_tree/merge_two_binary_trees.py, please provide doctest for the function merge_two_binary_trees
| print_preorder(root.right) | ||
|
|
||
|
|
||
| def main() -> None: |
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file data_structures/binary_tree/merge_two_binary_trees.py, please provide doctest for the function main
ruppysuppy
left a comment
There was a problem hiding this comment.
Doctest for main is irrelevant, please implement all other suggestions made by algorithms-keeper
ghost
left a comment
There was a problem hiding this comment.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.
algorithms-keeper commands and options
algorithms-keeper actions can be triggered by commenting on this PR:
@algorithms-keeper reviewto trigger the checks for only added pull request files@algorithms-keeper review-allto trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file data_structures/binary_tree/merge_two_binary_trees.py, please provide doctest for the function main
* Added code to merge two trees * Added doctest and type hints * Added pre-commit
* Added code to merge two trees * Added doctest and type hints * Added pre-commit
* Added code to merge two trees * Added doctest and type hints * Added pre-commit

Describe your change:
Merge two binary trees
Problem Description: Given two binary tree, return the merged tree.
The rule for merging is that if two nodes overlap, then put the value sum of
both nodes to the new value of the merged node. Otherwise, the NOT null node
will be used as the node of the new tree.
Checklist:
Fixes: #{$ISSUE_NO}.