Here you can find the source of removeEmptyNodes(Node node)
public static void removeEmptyNodes(Node node)
//package com.java2s; /* // www . j a v a2 s .c o m * Licensed to the Apache Software Foundation (ASF) under one * or more contributor license agreements. See the NOTICE file * distributed with this work for additional information * regarding copyright ownership. The ASF licenses this file * to you under the Apache License, Version 2.0 (the * "License"); you may not use this file except in compliance * with the License. You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, * software distributed under the License is distributed on an * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY * KIND, either express or implied. See the License for the * specific language governing permissions and limitations * under the License. * */ import java.util.LinkedList; import java.util.List; import org.w3c.dom.Node; import org.w3c.dom.NodeList; public class Main { public static void removeEmptyNodes(Node node) { NodeList list = node.getChildNodes(); List<Node> nodesToRecursivelyCall = new LinkedList<Node>(); for (int i = 0; i < list.getLength(); i++) { nodesToRecursivelyCall.add(list.item(i)); } for (Node tempNode : nodesToRecursivelyCall) { removeEmptyNodes(tempNode); } boolean emptyElement = node.getNodeType() == Node.ELEMENT_NODE && node.getChildNodes().getLength() == 0; boolean emptyText = node.getNodeType() == Node.TEXT_NODE && node.getNodeValue().trim().isEmpty(); if (emptyElement || emptyText) { node.getParentNode().removeChild(node); } } }