题目描述:
比较简单的一道题目
代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public boolean leafSimilar(TreeNode root1, TreeNode root2) {
List<Integer> r1 = new ArrayList<>();
List<Integer> r2 = new ArrayList<>();
getlef(root1, r1);
getlef(root2, r2);
return r1.equals(r2)? true : false;
}
public void getlef(TreeNode root1,List<Integer> tem){
if(root1 == null){
return ;
}
if(root1.left == null && root1.right == null){
tem.add(root1.val);
}
getlef(root1.left, tem);
getlef(root1.right, tem);
}
}