树的图示

hbghlyj

树是一种数据结构。输入树，用Javascript输出显示层次关系的字符串

1. class TreeNode {
2.   constructor(value) {
3.     this.value = value;
4.     this.children = [];
5.   }
7.   addChild(child) {
8.     this.children.push(child);
9.   }
10. }
12. function convertTreeToDiagram(node, prefix = '', isLast = true) {
13.   let diagram = prefix;
15.   if (isLast) {
16.     diagram += 'o-';
17.     prefix += '  ';
18.   } else {
19.     diagram += 'o-';
20.     prefix += '| ';
21.   }
23.   diagram += node.value + '\n';
25.   const childCount = node.children.length;
26.   for (let i = 0; i < childCount; i++) {
27.     const child = node.children[i];
28.     const isLastChild = i === childCount - 1;
29.     diagram += convertTreeToDiagram(child, prefix, isLastChild);
30.   }
32.   return diagram;
33. }

Copy the Code

用例

1. const tree = new TreeNode('A');
2. const childB = new TreeNode('B');
3. const childC = new TreeNode('C');
4. const childD = new TreeNode('D');
6. childB.addChild(new TreeNode('E'));
7. childB.addChild(new TreeNode('F'));
8. childD.addChild(new TreeNode('G'));
10. tree.addChild(childB);
11. tree.addChild(childC);
12. tree.addChild(childD);
14. const diagram = convertTreeToDiagram(tree);
15. console.log(diagram);

Copy the Code

o-A

  o-B

  | o-E

  | o-F

  o-C

  o-D

    o-G

文件系统：