duyi-edu / duyi-webalgorithm Goto Github PK

function f1(rootList, target) {
    if (rootList == null || rootList.length == 0) return false;
    var childList = []; //当前层所有节点的子节点，都在这个list中，这样传入下一层级的时候，就可以遍历整个层级的节点。
    for (var i = 0; i < rootList.length; i++) {
        if (rootList[i] != null && rootList[i].value == target) {
            return true;
        } else {
            if (rootList[i] !== null) {
                childList.push(rootList[i].left);
                childList.push(rootList[i].right);
            }
        }
    }
    console.log(childList);
    return f1(childList, target);
}