Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Day 422 #852

Closed
vaskoz opened this issue Jan 17, 2020 · 1 comment · Fixed by #853
Closed

Day 422 #852

vaskoz opened this issue Jan 17, 2020 · 1 comment · Fixed by #853
Assignees
@vaskoz

Comments

@vaskoz
Copy link
Owner

vaskoz commented Jan 17, 2020

Good morning! Here's your coding interview problem for today.

This problem was asked by Salesforce.

Write a program to merge two binary trees. Each node in the new tree should hold a value equal to the sum of the values of the corresponding nodes of the input trees.

If only one input tree has a node in a given position, the corresponding node in the new tree should match that input node.
@vaskoz vaskoz self-assigned this Jan 17, 2020
@vaskoz
Copy link
Owner Author

vaskoz commented Jan 17, 2020

Identical to Day 327: #662

@vaskoz vaskoz mentioned this issue Jan 17, 2020
Merged
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@vaskoz vaskoz

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

Day422 vaskoz/dailycodingproblem-go
1 participant
@vaskoz