Leetcode
2020.05.04 09:08

872. Leaf-Similar Trees

조회 수 648 추천 수 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 [todo] 687. Longest Univalue Path hooni 2020.05.01 203
76 Programmers team game secret hooni 2020.04.30 0
75 Programmers hashmap secret hooni 2020.04.30 0
74 Programmers fib secret hooni 2020.04.30 0
73 Leetcode 997. Find the Town Judge hooni 2020.05.02 686
72 Leetcode 994. Rotting Oranges file hooni 2020.04.14 154
71 Leetcode 993. Cousins in Binary Tree file hooni 2020.04.30 213
70 Leetcode 973. K Closest Points to Origin hooni 2020.04.15 152
69 Leetcode 946. Validate Stack Sequences hooni 2020.04.08 147
68 Leetcode 937. Reorder Data in Log Files hooni 2020.04.25 155
67 Leetcode 897. Increasing Order Search Tree hooni 2020.05.04 657
66 Leetcode 876. Middle of the Linked List hooni 2020.05.04 646
» Leetcode 872. Leaf-Similar Trees file hooni 2020.05.04 648
64 Leetcode 852. Peak Index in a Mountain Array hooni 2020.04.28 151
63 Leetcode 844. Backspace String Compare hooni 2020.05.05 705
62 Leetcode 783. Minimum Distance Between BST Nodes hooni 2020.05.01 700
61 Leetcode 763. Partition Labels hooni 2020.04.17 206
60 Leetcode 75. Sort Colors hooni 2020.04.14 139
59 Leetcode 731. My Calendar II hooni 2020.04.15 139
58 Leetcode 729. My Calendar I hooni 2020.04.15 142
Board Pagination Prev 1 2 3 4 Next
/ 4