递归搜索树形结构并返回搜索值

最新推荐文章于 2025-05-26 15:50:01 发布

mia1106

最新推荐文章于 2025-05-26 15:50:01 发布

阅读量4.3k

点赞数 2

CC 4.0 BY-SA版权

文章标签： js recursion return

本文链接：https://blog.youkuaiyun.com/mia1106/article/details/82905624

本文介绍如何使用JavaScript实现递归搜索树形结构以返回目标值。通过循环数组并判断label，找到匹配项后立即返回，若children非空则递归深入，最终在找到值后跳出循环。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

这里要处理的数据，是一组树型结构。如下

let options=
[
    {"value":1,"label":"三甲","children":[
             {"value":68,"label":"上海三甲","children":[{"value":681,"label":"---无---    ","children":null}]}, 
             {"value":69,"label":"江苏三甲","children":[{"value":691,"label":"---无---","children":null}]},
            {"value":70,"label":"浙江三甲","children":[{"value":701,"label":"---无---","children":null}]}]
    },

    {"value":71,"label":"二甲","children":[
            {"value":72,"label":"上海二甲","children":[{"value":721,"label":"---无---","children":null}]},
            {"value":73,"label":"江苏二甲","children":[{"value":731,"label":"---无---","children":null}]},
            {"value":74,"label":"浙江二甲","children":[{"value":741,"label":"---无---","children":null}]}]
    },

    {"value":75,"label":"社区医院","children":[
                {"value":76,"label":"上海社区医院","children":[{"value":761,"label":"---无---","children":null}]},
                {"value":77,"label":