LeetCode 872: Leaf-Similar Trees C++
这道题主要考察的是二叉树的遍历过程。这里我选择中序遍历来尝试访问所有的叶子节点。通过vector来存储访问的叶子节点。
/**
* 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;
}
};