js select 树形结构

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

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

// 创建树结构
const root = new TreeNode('Root');
const child1 = new TreeNode('Child1');
const child2 = new TreeNode('Child2');
const subChild1 = new TreeNode('SubChild1');

root.addChild(child1);
root.addChild(child2);
child1.addChild(subChild1);

// 深度优先遍历
function depthFirstTraversal(node) {
  console.log(node.value);
  for (const child of node.children) {
    depthFirstTraversal(child);
  }
}

// 广度优先遍历
function breadthFirstTraversal(root) {
  const queue = [root];
  while (queue.length > 0) {
    const node = queue.shift();
    console.log(node.value);
    queue.push(...node.children);
  }
}

// 搜索节点
function searchNode(root, value) {
  if (root.value === value) {
    return root;
  }
  for (const child of root.children) {
    const result = searchNode(child, value);
    if (result) {
      return result;
    }
  }
  return null;
}

// 使用示例
depthFirstTraversal(root); // 输出: Root, Child1, SubChild1, Child2
breadthFirstTraversal(root); // 输出: Root, Child1, Child2, SubChild1
console.log(searchNode(root, 'SubChild1').value); // 输出: SubChild1

function iterativeDepthFirstTraversal(root) {
  const stack = [root];
  while (stack.length > 0) {
    const node = stack.pop();
    console.log(node.value);
    for (let i = node.children.length - 1; i >= 0; i--) {
      stack.push(node.children[i]);
    }
  }
}