计算目录树的深度

[Sunny-117]

const tree = {
    name: 'root',
    children: [
        { name: '叶子1-1' },
        { name: '叶子1-2' },
        {
            name: '叶子2-1',
            children: [{
                name: '叶子3-1',
                children: [{
                    name: '叶子4-1',
                    children: [{}]
                }]
            }]
        }
    ]
}

function getLevel(tree) {
    if (tree == null) return 0;
    const queue = [tree]
    let dep = 0;
    while (queue.length) {
        dep++;
        const size = queue.length
        for (let i = 0; i < size; i++) {
            const node = queue.shift()
            if (node.children) {
                for (const child of node.children) {
                    queue.push(child)
                }
            }
        }
    }
    return dep
}
console.log(getLevel(tree));

[Jesslynwong]

let max = 0;
function depth(tree, deep) {
  if (tree.children === undefined || tree.name === undefined) {
    max = deep > max ? deep : max;
    return;
  }
  if (tree.children) {
    tree.children.forEach((element) => {
      depth(element, deep + 1);
    });
  }
}

depth(tree, 0);
console.log(max);

[kangkang123269]

function treeDepth(node) {
  if (node === null) {
    return 0;
  } else {
    const maxDepth = Math.max(...node.children.map(treeDepth));
    return maxDepth + 1;
  }
}

[lesenelir]

// 1. Method1: DFS
function getDepth(tree) {
  let depth = 0,
      maxDepth = 0

  traversal(tree)
  return maxDepth

  function traversal(node) { 
    if (!node) return

    depth++
    maxDepth = Math.max(maxDepth, depth)
    node.children && node.children.forEach(el => {
      traversal(el)
    })
    depth--
  }

}
console.log(getDepth(tree))


// 2. Method2: BFS
function getDepthBFS(tree) {
  let queue = [],
      res = 0

  if (tree) queue.push(tree)

  while (queue.length) {
    let levelCount = queue.length
    res++
    for (let i = 0; i < levelCount; i++) {
      let node = queue.shift()

      node.children && node.children.forEach(el => {
        queue.push(el)
      })
    }
  }

  return res
}
console.log(getDepthBFS(tree))

[l1ax]

function getLevel(tree) {
                if(!(tree.children && tree.children.length)) {
                    return 1
                }
                const {children} = tree
                let level = -Infinity
                for(const c of children) {
                    level = Math.max(level, getLevel(c) + 1)
                }
                return level
            }

[Aurora-GSW]

function getLevel(tree) {
    if (!tree) return 0
    if (tree.children && tree.children.length) {
        let res = []
        for (const item of tree.children) {
            res.push(getLevel(item))
        }
        return Math.max(...res) + 1
    }
    return 1
}