tree.sort((a, b) => {
            if (a.order !== b.order) {
                return a.order - b.order;
            }
            return a.cid - b.cid;