DFS这里是否能调整为尾递归

https://github.com/react-component/tree-select/blob/a000435807512c5799292abbd13bfe4649334bae/src/hooks/useFilterTreeData.ts#L40

function dig(list: DefaultOptionType[], keepAll: boolean = false): DefaultOptionType[] {
  function digRecursive(list: DefaultOptionType[], result: DefaultOptionType[]): DefaultOptionType[] {
    if (list.length === 0) {
      return result;
    }

    const dataNode = list[0];
    const children = dataNode[fieldChildren];
    const match = keepAll || filterOptionFunc(searchValue, fillLegacyProps(dataNode));
    const childList = dig(children || [], match);

    if (match || childList.length) {
      result.push({
        ...dataNode,
        isLeaf: undefined,
        [fieldChildren]: childList,
      });
    }

    return digRecursive(list.slice(1), result);
  }

  return digRecursive(list, []);
}

Start at src/hooks/useFilterTreeData.ts around the linked dig function and inspect how recursive filtering handles children, matches, and result ordering. Determine whether the DFS can be adjusted to tail recursion without changing filtering behavior or returned tree data, then verify the existing project checks for regressions.