JAVA_Leaf-Similar Trees

JAVA_Leaf-Similar Trees_LeetCode 872 풀이 class Solution { public boolean leafSimilar(TreeNode root1, TreeNode root2) { List<Integer> leaf1 = new ArrayList<Integer>(); List<Integer> leaf2 = new ArrayList<Integer>(); dfs(root1, leaf1); dfs(root2, leaf2); return leaf1.equals(leaf2); } public void dfs(TreeNode root, List leafs){ if (root == null) return; if (root.left == null && root.right ==null) leafs.add(root.val); dfs(root.right, leafs); dfs(root.left, leafs); } } * 출처 Leaf-Similar Trees - LeetCo...

#JAVA #JAVA_Leaf_SimilarTrees #JAVA_Leaf_SimilarTrees_LeetCode872 #JAVA_LeetCode872 #Leaf_SimilarTrees_LeetCode872

원문링크 : JAVA_Leaf-Similar Trees_LeetCode 872