何为广度优先搜搜

image.png
如上图 假如进行广度优先搜索的顺序为
A — C — B —F — G — D — E
广度优先搜索，同一行的搜索完后再去搜索下一行
代码实现广度优先搜索

  1. class Node {
  2.     constructor(value) {
  3.         this.value = value;
  4.         this.left = null;
  5.         this.right = null;
  6.     }
  7. }
  9. let a = new Node("a")
  10. let b = new Node("b")
  11. let c = new Node("c")
  12. let d = new Node("d")
  13. let e = new Node("e")
  14. let f = new Node("f")
  15. let g = new Node("g")
  16. a.left = c;
  17. c.left = f;
  18. b.left = d;
  19. a.right = b;
  20. b.right = e;
  21. c.right = g;
  22. /**
  23.  * 广度优先搜搜
  24.  * @param {*} rootList  查询列表
  25.  * @param {*} target  目标值
  26.  * @returns
  27.  */
  28. function f1(rootList , target){
  29.     if(rootList == null || rootList.length == 0) return false;
  30.     var childList = []
  31.     for (let i = 0; i < rootList.length; i++) {
  32.         if(rootList[i].value!= null) return false;
  33.         if(rootList[i] != null && rootList[i].value == target){
  34.             return true;
  35.         }else{
  36.             childList.push(rootList[i].left)
  37.             childList.push(rootList[i].right)
  38.         }
  39.     }
  40.     return f1(childList , target)
  41. }
  42. console.log(f1([a],"o"))