LeetCode 872 C++

/**
 * 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:
    bool leafSimilar(TreeNode* root1, TreeNode* root2) {
        vector<int> leaf1;
        vector<int> leaf2;
        in_TreeLeaf(root1,leaf1);
        in_TreeLeaf(root2,leaf2);
        if(leaf1.size()!=leaf2.size()) return false;
        else{
            for(int i=0;i<leaf1.size();i++){
                if(leaf1[i]!=leaf2[i]) return false;
            }
        }
        return true;
    }
    void in_TreeLeaf(TreeNode* root, vector<int> & leaf){
        if(root==NULL) return;
        if(root->left==NULL && root->right==NULL){
            leaf.push_back(root->val);
            return;
        }
        in_TreeLeaf(root->left,leaf);
        in_TreeLeaf(root->right,leaf);
        return;
    }
};