遍历树

    watch: {
            props(nv, ov) {
                console.log(nv);
                console.log(nv.inventories[0].tree,‘-------------------------tree‘);
                if(nv.inventories.length != 0){
　　　　　　　　　　　　//list为循环的树的数据
                    this.list = this.treeToList(nv.inventories[0].tree).reverse();
                }else{
                    this.list = [];
                }               
            },
            uuid(nv, ov) {
                // console.log(nv, ‘-----uuid‘);
                this.idcs = nv;
            }
        },
        mounted() {

        },
        methods: {
            toaddSnap() {
                this.$router.push({
                    path: "/addSnap",
                    query: {
                        id: this.idcs,
                    }
                });
            },
            treeToList(tree) {
                var queen = [];
                var out = [];
                queen = queen.concat(tree);
                while (queen.length) {
                    var first = queen.shift();
                    console.log(first.children,‘--------first‘);
                    if (first.children) {
                        queen = queen.concat(first.children);
                        delete first["children"];
                    }
                    out.push(first);
                }
                return out;//为循环的树结构数组
            },