• 문제 링크
Leaf-Similar Trees - LeetCode
Can you solve this real interview question? 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. [https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/16/tree.png
leetcode.com
• 풀이 코드
import java.util.ArrayList;
import java.util.List;
public class Solution {
public boolean leafSimilar(TreeNode root1, TreeNode root2) {
List<Integer> a = new ArrayList<>(), b = new ArrayList<>();
inorder(root1, a);
inorder(root2, b);
return a.equals(b);
}
private void inorder(TreeNode node, List<Integer> list) {
if (node.left == null && node.right == null) {
list.add(node.val);
return;
}
if (node.left != null) inorder(node.left, list);
if (node.right != null) inorder(node.right, list);
}
}'Problem Solving > LeetCode' 카테고리의 다른 글
| [LeetCode] 883. Projection Area of 3D Shapes - Java (0) | 2026.11.01 |
|---|---|
| [LeetCode] 876. Middle of the Linked List - Java (0) | 2026.10.31 |
| [LeetCode] 868. Binary Gap - Java (0) | 2026.10.29 |
| [LeetCode] 867. Transpose Matrix - Java (0) | 2026.10.28 |
| [LeetCode] 860. Lemonade Change - Java (0) | 2026.10.27 |
댓글