liang14658fox

Appearance

树形结构深度优先遍历 ​

js
let obj = {
	"zsl": "",
	"children": [{
			"zsl": null,
			"children": [{
				"zsl": "13%",
				"children": [],
			}],
		},
		{
			"zsl": null,
			"children": [{
				"zsl": "13%",
				"children": [],
			}, {
				"zsl": "6%",
				"children": [],
			}],
		}
	],
}

function traverseDAG(node) {
	if ('children' in node) { // 判断对象是否存在指定属性
		for (let child of node.children) {
			traverseDAG(child);
		}
	}
}
traverseDAG(obj)
let obj = {
	"zsl": "",
	"children": [{
			"zsl": null,
			"children": [{
				"zsl": "13%",
				"children": [],
			}],
		},
		{
			"zsl": null,
			"children": [{
				"zsl": "13%",
				"children": [],
			}, {
				"zsl": "6%",
				"children": [],
			}],
		}
	],
}

function traverseDAG(node) {
	if ('children' in node) { // 判断对象是否存在指定属性
		for (let child of node.children) {
			traverseDAG(child);
		}
	}
}
traverseDAG(obj)

该方法同样适用于有向无环图的数据结构