2019-03-18-10:36于公司
深度优先遍历的递归写法
function deepTraversal(node){
var nodes = [];
if(node){
nodes.push(node);
var children = node.children;
for(var i = 0; i < children.length){
deepTraversal(children)
}
}
return nodes;
}
深度优先
广度优先遍历的递归写法
function wideTraversal(node){
var nodes = [];
var i = 0;
if(node){
nodes.push(node);
wideTraversal(node.nextElementSibling);
node = nodes[i++];
wideTraversal(node.firstElementChild);
}
return nodes;
}
广度优先
网友评论