Depth and breadth first traversal of tree (regardless of binary tree)

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

Depth-first traversal

const dfs = (root) => {
    
	console.log(root.val)
	// root.children.forEach(dfs) Equate to root.children.forEach((child) => {dfs(child)})
	root.children.forEach(dfs)
}

Breadth first traversal

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)
}

I've been busy recently , After a long time, I summarized this article