https://leetcode.com/problems/leaf-similar-trees/

1. Use DFS:

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