Day40.cpp

/**
 * 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:
    void solve(TreeNode* root, vector<int>& v){
        if(root == NULL){
            return;
        }
        if(!root -> left && !root -> right){
            v.push_back(root -> val);
            return;
        }
        solve(root -> left, v);
        solve(root -> right, v);
    }
    bool leafSimilar(TreeNode* root1, TreeNode* root2) {
        vector<int> v1, v2;
        solve(root1, v1);
        solve(root2, v2);
        return v1 == v2;
    }
};