Leaf-Similar Trees LeetCode solution in C++

1
class Solution {
2
 public:
3
  void dfs(TreeNode *node, vector<int> &arr) {
4
    if (not node->left and not node->right) {
5
      arr.push_back(node->val);
6
      return;
7
    }
8
    if (node->left) dfs(node->left, arr);
9
    if (node->right) dfs(node->right, arr);
10
    return;
11
  }
12

13
  bool leafSimilar(TreeNode *a, TreeNode *b) {
14
    vector<int> aleaf, bleaf;
15
    dfs(a, aleaf);
16
    dfs(b, bleaf);
17
    return (aleaf == bleaf);
18
  }
19
};