leetcode872. 叶子相似的树

题目链接https://leetcode-cn.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:
    bool leafSimilar(TreeNode* root1, TreeNode* root2) {
        vector<int> nums1, nums2;
        findleaf(root1, nums1);
        findleaf(root2, nums2);

        if(nums1 == nums2){
            return true;
        }
        return false;
    }

    void findleaf(TreeNode* root, vector<int>& nums){
        if(root==NULL){
            return;
        }
        if(root->left==NULL && root->right==NULL){
            nums.push_back(root->val);
        }
        findleaf(root->left, nums);
        findleaf(root->right, nums);
    }
};

运行结果