js树形结构

class TreeNode {
  constructor(value) {
    this.value = value;
    this.children = [];
  }

  addChild(childNode) {
    this.children.push(childNode);
  }
}

// 创建根节点
const root = new TreeNode('Root');

// 创建子节点
const child1 = new TreeNode('Child 1');
const child2 = new TreeNode('Child 2');

// 添加子节点到根节点
root.addChild(child1);
root.addChild(child2);

// 创建孙节点
const grandChild1 = new TreeNode('GrandChild 1');
child1.addChild(grandChild1);

console.log(root);

function dfs(node) {
  if (!node) return;
  console.log(node.value);
  node.children.forEach(child => dfs(child));
}

dfs(root);

function bfs(root) {
  const queue = [root];
  while (queue.length > 0) {
    const node = queue.shift();
    console.log(node.value);
    queue.push(...node.children);
  }
}

bfs(root);

function findNodeByValue(node, value) {
  if (!node) return null;
  if (node.value === value) return node;
  for (const child of node.children) {
    const result = findNodeByValue(child, value);
    if (result) return result;
  }
  return null;
}

const foundNode = findNodeByValue(root, 'GrandChild 1');
console.log(foundNode);

function removeNodeByValue(node, value) {
  if (!node) return;
  node.children = node.children.filter(child => {
    if (child.value === value) {
      return false;
    } else {
      removeNodeByValue(child, value);
      return true;
    }
  });
}

removeNodeByValue(root, 'GrandChild 1');
console.log(root);