叶子相似的树-树872-c++

遍历二叉树，将叶子节点存在vec中。

/**
 * 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:
    vector<int> leaf1_vec;
    vector<int> leaf2_vec;

    void get_left_val(TreeNode* root, vector<int>& left_vec) {
        if (!root) return;
        if (!root->left && !root->right) {
            left_vec.emplace_back(root->val);
            return;
        }
        get_left_val(root->left, left_vec);
        get_left_val(root->right, left_vec);
    }

    bool leafSimilar(TreeNode* root1, TreeNode* root2) {
        get_left_val(root1, leaf1_vec);
        get_left_val(root2, leaf2_vec);

        return leaf1_vec == leaf2_vec;
    }
};