image.png
    这是树的深度优先搜索并不是二叉树的深度优先搜索
    实现源码

    1. class Node {
    2.     constructor(value) {
    3.         this.value = value;
    4.         this.child = [];
    5.     }
    6. }
    8. const A = new Node('A')
    9. const B = new Node('B')
    10. const C = new Node('C')
    11. const D = new Node('D')
    12. const E = new Node('E')
    13. const F = new Node('F')
    15. A.child.push(C)
    16. A.child.push(F)
    17. A.child.push(B)
    18. B.child.push(D)
    19. B.child.push(E)
    21. /**
    22.  * 树的深度优先搜索
    23.  * @param {*} root 节点
    24.  */
    25. function deepNode(root) {
    26.     if (root == null) return 
    27.     console.log(root.value)
    28.     for (let i = 0; i < root.child.length; i++) {
    29.         let newRoot = root.child[i]
    30.         deepNode(newRoot)
    31.     }
    32. }
    33. deepNode(A)

    打印结果
    image.png
    最终的代码

    1. class node {
    2.     constructor(value) {
    3.         this.value = value;
    4.         this.child = [];
    5.     }
    6. }
    8. const a = new node('a');
    9. const c = new node('c');
    10. const f = new node('f');
    11. const b = new node('b');
    12. const d = new node('d');
    13. const e = new node('e');
    15. a.child.push(c);
    16. a.child.push(f);
    17. a.child.push(b);
    18. b.child.push(d);
    19. b.child.push(e);
    20. /**
    21.  * 树的深度优先搜索
    22.  * @param {*} root 
    23.  * @param {*} target 
    24.  * @returns 
    25.  */
    26. function deepSearch(root,target) {
    27.     if(root == null) return false;
    28.     if(root.value == target) return true;
    29.     let result = false;
    30.     for(let i = 0; i < root.child.length; i++) {
    31.         result = deepSearch(root.child[i], target);
    32.     }
    33.     return result
    34. }
    36. console.log(deepSearch(a, 'e'))