树的深入和广度优先遍历（不考虑二叉树）

const tree = {
    
	val: 'a',
	children: [
		{
     val: 'b',
			children: [
				{
    
					val: 'd',
					children: []
				},
				{
    
					val: 'e',
					children: []
				},
			]
		},
		{
     val: 'c',
			children: [
				{
    
					val: 'f',
					children: []
				},
				{
    
					val: 'g',
					children: []
				},
			]
		},
	]
}

深度优先遍历

const dfs = (root) => {
    
	console.log(root.val)
	// root.children.forEach(dfs)等同于root.children.forEach((child) => {dfs(child)})
	root.children.forEach(dfs)
}

广度优先遍历

const bfs = () => {
    
	const q = [root]
	while(q.length > 0) {
    
		const n = q.shift()
		console.log(n.val)
		n.children.forEach((child) => {
    q.push(child)})
	}
	bfs(tree)
}

最近一段时间比较忙，隔了挺久总结了这一篇