[JavaScript知识库]js实现遍历树结构，查找某个节点的直接父节点。

1. 数据准备

// 树形数据
let data = { 
      name: '1',
      children: [{
          name: '1-1',
          children: [{
              name: '1-1-1',
              children: [{
                name: '1-1-1-1'
              }]
            },
            {
              name: '1-1-2'
            }
          ]
        },
        {
          name: '1-2',
          children: [{
              name: '1-2-1',
            },
            {
              name: '1-2-2',
              children: [{
                name: '1-2-2-1'
              }]
            }
          ]
        },
        {
          name: '1-3'
        }
      ]
    }

// 要查找的节点
let node = {
	name: '1-2-2-1'
}

2.代码实现

function getParent(node, tree) {
	let result = []
	function find(node, tree) {
		tree.children.forEach(item => {
			if (item.name === node.name) {
            	result.push(tree)
          	}
          	if ('children' in item) {
            	find(node, item)
          	}
		});
	}
	find(node, tree)
	return result[0]
}

创作打卡挑战赛

赢取流量/现金/CSDN周边激励大奖