返回嵌套树中的匹配节点: Javascript

// 定义一个嵌套树结构
const tree = {
  value: 'A',
  children: [
    {
      value: 'B',
      children: [
        {
          value: 'C',
          children: []
        },
        {
          value: 'D',
          children: []
        }
      ]
    },
    {
      value: 'E',
      children: [
        {
          value: 'F',
          children: []
        }
      ]
    }
  ]
};

// 定义一个递归函数，用于查找匹配节点
function findMatchingNode(tree, targetValue) {
  if (tree.value === targetValue) {
    return tree;
  }
  for (let child of tree.children) {
    const matchingNode = findMatchingNode(child, targetValue);
    if (matchingNode) {
      return matchingNode;
    }
  }
  return null;
}

// 调用函数查找匹配节点
const targetValue = 'C';
const matchingNode = findMatchingNode(tree, targetValue);

if (matchingNode) {
  console.log('找到匹配节点:', matchingNode);
} else {
  console.log('未找到匹配节点');
}