二叉树的广度优先搜索
代码演示
function Node(value) {
this.value = value;
this.left = null;
this.right = null;
}
var a = new Node("a");
var b = new Node("b");
var c = new Node("c");
var d = new Node("d");
var e = new Node("e");
var f = new Node("f");
var g = new Node("g");
a.left = c;
a.right = b;
c.left = f;
c.right = g;
b.left = d;
b.right = e;
function fn(rootList, target) {
if (rootList === null || rootList.length === 0) return false;
var childList = []; // 定义一个数组存放当前层所有节点的子节点,这样传入下一层级的时候,就可以遍历整个层级的节点。
for (var i = 0; i < rootList.length; i++) {
console.log(rootList[i].value); // a c b f g d e 一层一层的找的
if (rootList[i] !== null && rootList[i].value === target) {
return true;
} else {
childList.push(rootList[i].left);
childList.push(rootList[i].right);
}
}
return fn(childList, target);
}
console.log(fn([a], "e")); // true
运行结果
下一篇:
前端必学算法——二叉树的比较