//遍历指定父节点下的直接子节点--使用DOM方法递归遍历节点树
function getChildren(parent){
console.log(
parent.nodeType!=3?parent.nodeName:
parent.nodeValue
);
var childNodes=parent.childNodes;
for(var i=0;i<childNodes.length;i++){
getChildren(childNodes[i]);
}
}
/*
function getChildren(parent){
var start=parent;
console.log(
parent.nodeType!=3?parent.nodeName:
parent.nodeValue
);
for(;;){
if(parent.firstChild){
parent=parent.firstChild;
console.log(
parent.nodeType!=3?parent.nodeName:
parent.nodeValue
);
}else if(parent.nextSibling){
parent=parent.nextSibling;
console.log(
parent.nodeType!=3?parent.nodeName:
parent.nodeValue
);
}else{
parent=parent.parentNode;
if(parent==start){
break;
}else if(parent.nextSibling){
parent=parent.nextSibling;
console.log(
parent.nodeType!=3?parent.nodeName:
parent.nodeValue
);
}
}
}
}
*/
window.onload=function(){
getChildren(document.body);
};