如何有效过滤保留其现有结构的树形视图？

您可以使用嵌套递归方法并过滤树，同时尊重找到的项目。

此解决方案不会更改原始数据。

function filter(array, text) {    const getNodes = (result, object) => {        if (object.text === text) { result.push(object); return result;        }        if (Array.isArray(object.nodes)) { const nodes = object.nodes.reduce(getNodes, []); if (nodes.length) result.push({ ...object, nodes });        }        return result;    };    return array.reduce(getNodes, []);}var tree = [{ text: "Parent 1", nodes: [{ text: "Child 1", type: "Child", nodes: [{ text: "Grandchild 1", type: "Grandchild" }, { text: "Grandchild 2", type: "Grandchild" }] }, { text: "Child 2", type: "Child" }] }, { text: "Parent 2", type: "Parent" }, { text: "Parent 3", type: "Parent" }];console.log(filter(tree, 'Parent 1'));console.log(filter(tree, 'Child 1'));console.log(filter(tree, 'Grandchild 2'));.as-console-wrapper { max-height: 100% !important; top: 0; }