872. 叶子相似的树

咔咔咔的

于 2024-07-19 06:31:33 发布

阅读量249

点赞数 7

分类专栏： leetcode 文章标签： leetcode c++

本文链接：https://blog.csdn.net/weixin_45256307/article/details/140538323

版权

leetcode 专栏收录该内容

501 篇文章 2 订阅

订阅专栏

872. 叶子相似的树

题目链接：872. 叶子相似的树

代码如下：

/**
 * 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> leaves1;
        vector<int> leaves2;
        preorder(root1,leaves1);
        preorder(root2,leaves2);
        if(leaves1==leaves2)    {return true;}
        return false;
    }
private:
    void preorder(TreeNode* root,vector<int>& leaves)
    {
        if(root==nullptr)   {return;}
        if(root->left==nullptr&&root->right==nullptr)
        {
            leaves.push_back(root->val);
        }
        if(root->left)  {preorder(root->left,leaves);}
        if(root->right)  {preorder(root->right,leaves);}
    }
};