js 递归处理树结构数据

<script type="text/javascript">

    list = [
        {
            id: "1",
            parentId: "root",
            name: "根节点1"
        },{
            id: "2",
            parentId: "1",
            name: "1-2"
        },{
            id: "3",
            parentId: "1",
            name: "1-3"
        },{
            id: "4",
            parentId: "3",
            name: "3-4"
        },{
            id: "5",
            parentId: "3",
            name: "3-5"
        },{
            id: "6",
            parentId: "3",
            name: "3-6"
        }
    ];

    console.log(treeData());

    function treeData(){
        var a = function queryTreeCode(id){
            var code = []
            for(var v = 0;v < list.length;v++){
                if(list[v].parentId == id){
                    code.push({
                        label: list[v].name,
                        children: a(list[v].id)
                    })
                }
            }
            return code;
        }
        var tree = a("root");
        return tree;
    }

</script>