-
[LeetCode] 617. Merge Two Binary Trees c++Coding Test/LeetCode 2022. 9. 27. 11:10728x90
- 문제
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. Otherwise, the NOT null node will be used as the node of the new tree.
Return the merged tree.
depth가 같은 두 이진트리의 값을 합치는 문제이다.
- 문제 해결
TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) { if(root1 && root2){ TreeNode *root = new TreeNode(root1->val + root2->val); root->left = mergeTrees(root1->left, root2->left); root->right = mergeTrees(root1->right, root2->right); return root; } else{ return root1 ? root1 : root2; } }
728x90'Coding Test > LeetCode' 카테고리의 다른 글
[LeetCode] 1929. Concatenation of Array c++ (0) 2022.10.10 [LeetCode] 897. Increasing Order Search Tree c++ (0) 2022.09.27 [LeetCode] 2331. Evaluate Boolean Binary Tree c++ (0) 2022.09.26 [LeetCode] 938. Range Sum of BST c++ (0) 2022.09.26 [LeetCode] 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree c++ (0) 2022.09.26