Leetcode
2020.05.04 09:08

872. Leaf-Similar Trees

조회 수 678 추천 수 0 댓글 0
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄 첨부
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄 첨부

Consider all the leaves of a binary tree.  From left to right order, the values of those leaves form a leaf value sequence.

For example, in the given tree above, the leaf value sequence is (6, 7, 4, 9, 8).

Two binary trees are considered leaf-similar if their leaf value sequence is the same.

Return true if and only if the two given trees with head nodes root1 and root2 are leaf-similar.

 

Constraints:

  • Both of the given trees will have between 1 and 200 nodes.
  • Both of the given trees will have values between 0 and 200


/**
 * 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/



?

List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
77 Leetcode 1055. Shortest Way to Form String hooni 2020.04.06 212
76 Leetcode 107. Binary Tree Level Order Traversal II hooni 2020.04.29 222
75 Leetcode 108. Convert Sorted Array to Binary Search Tree hooni 2020.05.01 186
74 Leetcode 110. Balanced Binary Tree hooni 2020.05.01 211
73 Leetcode 1108. Defanging an IP Address hooni 2020.05.01 197
72 Leetcode 111. Minimum Depth of Binary Tree hooni 2020.04.30 190
71 Leetcode 112. Path Sum hooni 2020.05.01 201
70 Leetcode 1122. Relative Sort Array hooni 2020.04.28 224
69 Leetcode 114. Flatten Binary Tree to Linked List hooni 2020.04.06 174
68 Leetcode 121. Best Time to Buy and Sell Stock hooni 2020.04.17 177
67 Leetcode 126. Word Ladder II hooni 2020.04.17 177
66 Leetcode 139. Word Break hooni 2020.04.18 182
65 Leetcode 2. Add Two Numbers hooni 2020.04.14 155
64 Leetcode 20. Valid Parentheses hooni 2020.04.25 322
63 Leetcode 202. Happy Number hooni 2020.04.28 216
62 Leetcode 203. Remove Linked List Elements hooni 2020.05.04 648
61 Leetcode 206. Reverse Linked List hooni 2020.04.28 173
60 Leetcode 222. Count Complete Tree Nodes hooni 2020.05.05 707
59 Leetcode 225. Implement Stack using Queues hooni 2020.05.05 739
58 Leetcode 23. Merge k Sorted Lists hooni 2020.04.14 156
Board Pagination Prev 1 2 3 4 Next
/ 4