leetcode 树的相同子树和结构

剑指 Offer 26. 树的子结构

class Solution {
    public boolean isSubStructure(TreeNode A, TreeNode B) {
        if (A == null || B == null) {
            return false;
        }
        // 判断以 root 为根的二叉树是否和 subRoot 相同
        if (isSameStructure(A, B)) {
            return true;    
        }
        // 去左右子树中判断是否有和 subRoot 相同的子树
        return isSubStructure(A.left, B) || isSubStructure(A.right, B);
    }
    public boolean isSameStructure(TreeNode p, TreeNode q) {
        // 判断一对节点是否结构相同
        if(q == null) {
            return true;
        }
        if(p == null) {
            return false;
        }
        // 判断其他节点结构相同
        return p.val == q.val && isSameStructure(p.left, q.left) && isSameStructure(p.right, q.right);
    }
}

572. 另一棵树的子树

class Solution {
    public boolean isSubtree(TreeNode root, TreeNode subRoot) {
        if (root == null) {
            return subRoot == null;
        }
        // 判断以 root 为根的二叉树是否和 subRoot 相同
        if (isSameTree(root, subRoot)) {
            return true;
        }
        // 去左右子树中判断是否有和 subRoot 相同的子树
        return isSubtree(root.left, subRoot) || isSubtree(root.right, subRoot);
    }

    public boolean isSameTree(TreeNode p, TreeNode q) {
        // 判断一对节点是否相同
        if (p == null && q == null) {
            return true;
        }
        if (p == null || q == null) {
            return false;
        }
        if (p.val != q.val) {
            return false;
        }
        // 判断其他节点是否相同
        return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
    }
}

652. 寻找重复的子树

class Solution {
    HashMap<String, Integer> memo = new HashMap<>();
    LinkedList<TreeNode> res = new LinkedList<>();

    public List<TreeNode> findDuplicateSubtrees(TreeNode root) {
        traverse(root);
        return res;
    }

    String traverse(TreeNode root) {
        if(root == null) {
            return "#";
        }
        String left = traverse(root.left);
        String right = traverse(root.right);

        String subTree = left + "," + right + "," + root.val;

        int count = memo.getOrDefault(subTree, 0);
        if(count == 1) {
            res.add(root);
        }
        memo.put(subTree, count + 1);
        return subTree;

    }
}