leetcode 872叶子相似的树

深度优先搜索，采用递归算法，用ArrayList记录叶子结点的数值，最后判断遍历两颗树得到的序列是否完全相等。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean leafSimilar(TreeNode root1, TreeNode root2) {
        List<Integer> seq1 = new ArrayList<>();
        List<Integer> seq2 = new ArrayList<>();
        dfs(root1,seq1);
        dfs(root2,seq2);
        return seq1.equals(seq2);
    }
    public void dfs(TreeNode root,List<Integer> seq){
        if(root==null){return;}
        if(root.left==null&&root.right==null){
            seq.add(root.val);
        }
        dfs(root.left,seq);
        dfs(root.right,seq);
    }
}