JS:使用类实现树的深度优先遍历和广度优先遍历(五颗星)

树的深度优先遍历：递归实现

树的广度优先遍历：队列实现

class Node {
            constructor(data){
                this.data=data;
                this.children=[];
            }
            //深度优先遍历
            dfs(){
                console.log(this.data);
                for(const child of this.children){
                    child.dfs();
                }
            }
            //广度优先遍历
            bfs() {
                const queue = [];
                queue.push(this);
                while (queue.length) {
                    const node = queue.shi