[LeetCode] 617. Merge Two Binary Trees - 문제풀이
Description 두개의 이진트리를 병합하는 문제입니다. DFS와 유사하게 해결 할 수 있습니다. You are given two binary trees root1 and root2. Imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. You need to merge the two trees into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Othe..
