문제를 푼 날: 2022년 11월 13일 오후 2:16 (GMT+9)

https://leetcode.com/problems/same-tree/

Given the roots of two binary trees p and q, write a function to check if they are the same or not.

Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.

Example 1:

Input: p = [1,2,3], q = [1,2,3]
Output: true

Example 2:

Input: p = [1,2], q = [1,null,2]
Output: false

Example 3:

Input: p = [1,2,1], q = [1,1,2]
Output: false

Constraints:

• The number of nodes in both trees is in the range [0, 100].
• 104 <= Node.val <= 104

Solution

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    
    bool travel(TreeNode* curP, TreeNode* curQ){
        if(curP == nullptr && curQ == nullptr){
            return true;
        }
        else if(curP == nullptr || curQ == nullptr){
            return false;
        }
        
        return (curP->val == curQ->val) && 
								travel(curP->left, curQ->left) && 
								  travel(curP->right, curQ->right);
    }
    
    
    bool isSameTree(TreeNode* p, TreeNode* q) {
        return travel(p, q);
    }
};