C#树结构的查询方法

数据为标准的树结构，Children为子集
用时需要将下文‘Ent’替换为自己的实体类型

/// <summary>
/// 查询树
/// </summary>
/// <param name="tree">树结构</param>
/// <param name="value">查询条件</param>
private void HandleSearch(List<Ent> tree, string value)
{
    //不满足搜索条件的待删除元素索引数组
    var removeArr = new List<int>();
    for (var i = 0; i < tree.Count; i++)
    {
        var node = tree[i];
        SearchTree(node, i, value, removeArr);
    }
    //遍历删除不满足条件的节点
    if (removeArr?.Count > 0)
        removeArr.ForEach(m => tree.RemoveAt(m));
}

/// <summary>
/// 递归查询
/// </summary>
/// <param name="node">树节点</param>
/// <param name="index">当前节点索引</param>
/// <param name="value">查询条件</param>
/// <param name="removeArr">待删除元素的索引</param>
private void SearchTree(Ent node, int index, string value, List<int> removeArr)
{
    var children = node.Children;
    //针对非叶子节点，需要递归其Children节点
    if (children?.Count > 0)
    {
        var innderArr = new List<int>();
        for (var i = 0; i < children.Count; i++)
        {
            SearchTree(children[i], i, value, innderArr);
        }
        //对当前节点Children不满足条件的节点执行删除操作
        for (var j = innderArr.Count - 1; j >= 0; j--)
        {
            children.RemoveAt(innderArr[j]);
        }
        if (!node.Value.Contains(value))
        {
            //当前节点不满足搜索条件且子节点为空，将其加入待删除列表
            if (node.Children == null || node.Children.Count == 0)
            {
                removeArr.Add(index);
            }
        }
    }
    else
    {
        //叶子节点，直接进行匹配
        if (!node.Value.Contains(value))
        {
            removeArr.Add(index);
        }
    }
}