leetcode617 C++ 36ms 合并二叉樹

標籤：node   tree   二叉樹   etc   binary   ==   class   nullptr   null   

/** * Definition for a binary tree node. * struct TreeNode { *     int val; *     TreeNode *left; *     TreeNode *right; *     TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:    TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {        if(t1==nullptr && t2 ==nullptr){            return nullptr;        }        if(t1==nullptr){            return t2;        }        if(t2==nullptr){            return t1;        }        t1->val += t2->val;        t1->left = mergeTrees(t1->left, t2->left);        t1->right = mergeTrees(t1->right, t2->right);        return t1;    }};

leetcode617 C++ 36ms 合并二叉樹