Obsidian_Note/数据结构与算法之美/深度优先遍历.md

深度优先遍历

TODO：占个位置以后再写

const node = {
	name: "node 1",
	children: []
};

function DFS(node) {
	console.log("探寻", node.name);
	node.children.forEach(child => {
		DFS(child);
	});
	console.log("回溯", node.name);
}