本文实例讲述了JavaScript实现树的遍历算法。分享给大家供大家参考，具体如下：
搜索方法出自Aimingoo的【JavaScript语言精髓与编程实践】
var deepView = function(aTree,iNode) {
(iNode in aTree) && (document.write(aTree[iNode]+'
'),arguments.callee(aTree,2*iNode+1),2*iNode+2)) } //广度优先 var wideView = function(aTree,iNode) { var aRTree = aTree.slice(0),iRNode = iNode,iLevel = 1; (iRNode in aRTree) && document.write(aRTree[iRNode]+'
'); (function() { var iStart = iRNode*2+1,iEnd = iStart+Math.pow(2,iLevel); document.write(aRTree.slice(iStart,iEnd).join(',')+'
'); if(iEnd>=aRTree.length) return; iRNode = iStart,iLevel++,arguments.callee(); })() } document.write('
'),arguments.callee(aTree,2*iNode+1),2*iNode+2)) } //广度优先 var wideView = function(aTree,iNode) { var aRTree = aTree.slice(0),iRNode = iNode,iLevel = 1; (iRNode in aRTree) && document.write(aRTree[iRNode]+'
'); (function() { var iStart = iRNode*2+1,iEnd = iStart+Math.pow(2,iLevel); document.write(aRTree.slice(iStart,iEnd).join(',')+'
'); if(iEnd>=aRTree.length) return; iRNode = iStart,iLevel++,arguments.callee(); })() } document.write('
二叉树 深度优先
'); //深度优先 deepView(t,0); document.write('二叉树 广度优先
'); //广度优先 wideView(t,0);运行结果：
更多关于JavaScript相关内容感兴趣的读者可查看本站专题：《》、《》、《》、《》、《》及《》
希望本文所述对大家JavaScript程序设计有所帮助。
原文链接：https://www.f2er.com/js/35549.html