652. Find Duplicate Subtrees

Given the root of a binary tree, return all duplicate subtrees.

For each kind of duplicate subtrees, you only need to return the root node of any one of them.

Two trees are duplicate if they have the same structure with the same node values.

Example 1:

Input: root = [1,2,3,4,null,2,4,null,null,4]
Output: [[2,4],[4]]

Example 2:

Input: root = [2,1,1]
Output: [[1]]

Example 3:

Input: root = [2,2,2,3,null,3,null]
Output: [[2,3],[3]]
 

Constraints:

The number of the nodes in the tree will be in the range [1, 10^4]
-200 <= Node.val <= 200

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/find-duplicate-subtrees
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

要判断当前节点是否一样，就要先知道，它的子节点是否一样，这样，就需要用到后序遍历。用一个map储存遍历后的字符串的个数。

class Solution {
    List<TreeNode> list  = new ArrayList<>();
    Map<String, Integer> map = new HashMap<>();
    public List<TreeNode> findDuplicateSubtrees(TreeNode root) {
        travel(root);
        return list;
    }

    String travel(TreeNode root) {
        if (root == null) {
            return "#";
        }
        String left = travel(root.left);
        String right = travel(root.right);
        String str = left + "," + right + "," + root.val;
        if (map.containsKey(str)) {
            if (map.get(str) == 1) {
                list.add(root);
            }
            map.put(str, map.get(str) + 1);
        } else {
            map.put(str, 1);
        }
        return str;
     }
}