叶子相似的树（Leaf-Similar Trees）

72. Leaf-Similar Trees

来源： LeetCode 72. Leaf-Similar Trees

题目描述

72. Leaf-Similar Trees
Consider all the leaves of a binary tree.  From left to right order, the values of those leaves form a leaf value sequence.



For example, in the given tree above, the leaf value sequence is (6, 7, 4, 9, 8).

Two binary trees are considered leaf-similar if their leaf value sequence is the same.

Return true if and only if the two given trees with head nodes root1 and root2 are leaf-similar.

 

Constraints:

Both of the given trees will have between 1 and 200 nodes.
Both of the given trees will have values between 0 and 200

思路分析

没啥好说的DFS获取每个记录，依次比较

代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
# define PB(A) push_back(A);
# define REP(i, a) for(int i= 0; i<(a); ++i)
using VI = vector<int>;
public:
    bool leafSimilar(TreeNode* root1, TreeNode* root2) {
        // write a code DFS travel
        VI a1; dfsTravel(a1, root1);
        VI a2; dfsTravel(a2, root2);
        if(a1.size() != a2.size()) return false;
        REP(i, a1.size()){
            if(a1[i] != a2[i]) return false;
        }
        return true;
    }
    void dfsTravel(VI& res, TreeNode* root){
        if(!root) return;
        if(!root->left && !root->right) res.PB(root->val);
        dfsTravel(res, root->left);
        dfsTravel(res, root->right);
    }
};