Example of the traversal algorithm for the JavaScript implementation tree [breadth first and depth first], javascript Algorithm

Example of the traversal algorithm for the JavaScript implementation tree [breadth first and depth first], javascript Algorithm

This article describes the traversal algorithm of the JavaScript implementation tree. We will share this with you for your reference. The details are as follows:

<Script type = "text/javascript"> var t = [,]; // The following deep-Priority Search Method comes from Aimingoo's [JavaScript language essence and programming practices] var deepView = function (aTree, iNode) {(iNode in aTree) & (document. write (aTree [iNode] + '<br/>'), arguments. callee (aTree, 2 * iNode + 1), arguments. callee (aTree, 2 * iNode + 2)} // breadth-first var wideView = function (aTree, iNode) {var aRTree = aTree. slice (0), iRNode = iNode, iLevel = 1; (iRNode in aRTree) & document. write (aRTree [iRNode] + '<br/>'); (function () {var iStart = iRNode * 2 + 1, iEnd = iStart + Math. pow (2, iLevel); document. write (aRTree. slice (iStart, iEnd ). join (',') + '<br/>'); if (iEnd> = aRTree. length) return; iRNode = iStart, iLevel ++, arguments. callee () ;}) ()} document. write ('
Running result: