2022.7.15-----leetcode. five hundred and fifty-eight

 public Node intersect(Node quadTree1, Node quadTree2) {
         // When at least 1 When one is a leaf 
        if (quadTree1.isLeaf) {
            if (quadTree1.val) // When a tree is 1 leaf , This node must be 1 leaf 
                return new Node(true, true);
            else// if 0 leaf , This node is the same as another tree node 
                return new Node(quadTree2.val, quadTree2.isLeaf, 
                quadTree2.topLeft, quadTree2.topRight, quadTree2.bottomLeft, quadTree2.bottomRight);
        }
        if (quadTree2.isLeaf) {
            return intersect(quadTree2, quadTree1);// Inversion order 
        }
        // The nodes of both trees are not leaves 
        Node o1 = intersect(quadTree1.topLeft, quadTree2.topLeft);
        Node o2 = intersect(quadTree1.topRight, quadTree2.topRight);
        Node o3 = intersect(quadTree1.bottomLeft, quadTree2.bottomLeft);
        Node o4 = intersect(quadTree1.bottomRight, quadTree2.bottomRight);
        // When the child nodes are all leaves with the same value , This node is a leaf 
        if (o1.isLeaf && o2.isLeaf && o3.isLeaf && o4.isLeaf && 
        o1.val == o2.val && o1.val == o3.val && o1.val == o4.val) {
            return new Node(o1.val, true);
        }else// Otherwise, the node is not a leaf 
            return new Node(false, false, o1, o2, o3, o4);
        
    }