The example in this article describes the method of recursively printing Document hierarchical relationships in Javascript. Share it with everyone for your reference. The details are as follows:
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<title>递归显示节点层次关系</title>
<script type="text/javascript">
var ResultStr = "";
function ListNode(node,level) {
PrintInfo(node, level);
level++;
var nodes = node.childNodes;
for (var i = 0; i < nodes.length; i++) {
if (nodes[i].hasChildNodes()) {
ListNode(nodes[i], level); //递归
}
else {
PrintInfo(nodes[i], level);
}
}
}
function getSpace(level) {
var s = "";
for (var i = 0; i < level; i++) {
s+="!----"
}
return s;
}
function PrintInfo(node, level) {
ResultStr += getSpace(level) + "Name:" + node.nodeName +
"...Type:" + node.nodeType + "...Value:" + node.nodeValue + "<br />";
}
function getDocAllInfo() {
ResultStr = "";
ListNode(document, 0);
document.write(ResultStr);
}
</script>
</head>
<body>
<input type="button" value="测试" onclick="getDocAllInfo()" />
<div id="divDemo">div内容</div>
<table>
<tr>
<td>单元格1</td>
<td>单元格2</td>
</tr>
<tr>
<td>单元格3</td>
<td>单元格4</td>
</tr>
</table>
<input type="text" />
<span>我是SPAN</span>
<!--我是注释-->
</body>
</html>I hope this article will be helpful to everyone’s JavaScript programming design.
![[Web front-end] Node.js quick start](https://img.php.cn/upload/course/000/000/067/662b5d34ba7c0227.png)
