leaf_similar.cpp

//program to check if 2 binary tree have same leaf node or not
//problem link: https://leetcode.com/problems/leaf-similar-trees/

/**
 * 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 pushLeaf(TreeNode * root, vector<int>&v)
    {
        if(root == NULL) return ;
        if(root -> left == NULL && root -> right == NULL) v.push_back(root -> val);
        pushLeaf(root -> left , v);
        pushLeaf(root -> right, v);
    }

    bool leafSimilar(TreeNode* root1, TreeNode* root2) {
        vector<int>v1,v2;
        pushLeaf(root1, v1);
        pushLeaf(root2, v2);
        return v1 == v2 ;
    }
};