Leaf-Similar Trees

두 바이너리 트리의 루트 노드를 받고

두 트리에서 리프 노드들의 값과 순서가 같은지 판단하는 문제

/**
 * 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 SearchLeafDFS(TreeNode *root, vector<int> &result)
    {
        if (root == NULL)
        {
            return;
        }

        if (root->left == NULL && root->right == NULL)
        {
            result.push_back(root->val);
        }
        else
        {
            SearchLeafDFS(root->left, result);
            SearchLeafDFS(root->right, result);
        }
    }

    bool leafSimilar(TreeNode* root1, TreeNode* root2) {
        
        vector<int> leaf1{};
        vector<int> leaf2{};

        SearchLeafDFS(root1, leaf1);
        SearchLeafDFS(root2, leaf2);

        int length = leaf1.size();
        if (length != leaf2.size())
        {
            return false;
        }

        for (int i = 0; i < length; i++)
        {
            if (leaf1[i] != leaf2[i])
            {
                return false;
            }
        }

        return true;
    }
};