leaf-similar-trees.cpp

/**
 * 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:
  void dfs(TreeNode *node, vector<int> &leaves) {
    if (node == NULL)
      return;
    if (node->left == NULL && node->right == NULL)
      leaves.push_back(node->val);
    dfs(node->left, leaves);
    dfs(node->right, leaves);
  }
  bool leafSimilar(TreeNode *root1, TreeNode *root2) {
    vector<int> leaves1;
    vector<int> leaves2;
    dfs(root1, leaves1);
    dfs(root2, leaves2);

    return leaves1 == leaves2;
  }
};