872. 叶子相似的树 （递归 深度遍历）

递归

/**
 * 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> list1=new ArrayList<>();
        List<Integer> list2=new ArrayList<>();
        list1=dfs(root1,list1);
        list2=dfs(root2,list2);
      return list1.equals(list2);

    }

    private List<Integer> dfs(TreeNode root, List<Integer> list) {
        if (root.left==null && root.right==null)
        {
            list.add(root.val);
        }else {
            if (root.left!=null)
            {
                dfs(root.left,list);
            }
            if (root.right!=null)
            {
                dfs(root.right,list);
            }
        }
        return list;
    }
}