872. Leaf-Similar Trees

/**
 * 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<TreeNode> list1 = new ArrayList<>();
        List<TreeNode> list2 = new ArrayList<>();
        
        findLeaves(root1, list1);
        findLeaves(root2, list2);
        
        if(list1.size() != list2.size()){
            return false;
        }
        
        int loop = list1.size();
        for(int i=0; i<loop; i++){
            TreeNode node1 = list1.get(i);
            TreeNode node2 = list2.get(i);
            //System.out.println(node1+" == "+node2);
            if(node1.val != node2.val){
                return false;
            }
        }
        
        return true;
    }
    
    public void findLeaves(TreeNode node, List<TreeNode> list){
        if(node == null){
            return;
        }
        
        findLeaves(node.left, list);
        findLeaves(node.right, list);
        
        if(node.left == null && node.right == null){
            list.add(node);
        }
    }
}

[문제] https://leetcode.com/problems/leaf-similar-trees/