【树】872. 叶子相似的树

 1 /**
 2  * Definition for a binary tree node.
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12      bool leafSimilar(TreeNode* root1, TreeNode* root2) 
13      {
14         vector<int> leaves1;
15         vector<int> leaves2;
16         dfs(root1, leaves1);
17         dfs(root2, leaves2);
18 
19         return leaves1 == leaves2;
20     }
21 
22     void dfs(TreeNode* node, vector<int>& leaves) 
23     {
24         if (node == NULL) 
25         {
26             return;
27         }
28         if (node->left == NULL && node->right == NULL)
29         {
30             leaves.push_back(node->val);
31         }
32         
33         dfs(node->left, leaves);
34         dfs(node->right, leaves);
35     }
36 };