递归啦
/**
* 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) {
string s1,s2;
getLeaf(root1,s1);
getLeaf(root2,s2);
return s1 == s2;
}
void getLeaf(TreeNode* root,string & s)
{
if(!root) return;
else if(!root->left && !root->right)
{
s.push_back(root->val);
}
getLeaf(root->left,s);
getLeaf(root->right,s);
}
};