Problem: 872. Leaf-Similar Trees 叶子相似的树

解题过程

耗时100%，前序遍历的，拿到叶子节点，顺序默认从左到右，判断两者是否相等

Code

/** * 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: vector<int> tr, t1, t2; void dfs(TreeNode* root) { if(root==nullptr) return; if(root->left==nullptr && root->right==nullptr) { tr.push_back(root->val); } dfs(root->left); dfs(root->right); } bool leafSimilar(TreeNode* root1, TreeNode* root2) { dfs(root1); t1 = tr; tr.clear(); dfs(root2); return t1==tr; } };