js pid 递归输出树

const tree = {
  name: 'root',
  children: [
    {
      name: 'folder1',
      children: [
        { name: 'file1.txt', children: [] },
        { name: 'file2.txt', children: [] }
      ]
    },
    {
      name: 'folder2',
      children: [
        {
          name: 'subfolder1',
          children: [
            { name: 'file3.txt', children: [] }
          ]
        }
      ]
    },
    { name: 'file4.txt', children: [] }
  ]
};

function printTree(node, level = 0) {
  // 打印当前节点的名称，并根据层级添加缩进
  console.log('  '.repeat(level) + node.name);
  
  // 如果有子节点，递归调用printTree函数
  if (node.children && node.children.length > 0) {
    for (const child of node.children) {
      printTree(child, level + 1);
    }
  }
}

// 调用函数开始打印树
printTree(tree);

root
  folder1
    file1.txt
    file2.txt
  folder2
    subfolder1
      file3.txt
  file4.txt