如下所示：
// get the top level nodes
for(var i=0; i<list.length; i++){
var row = list[i];
if (!exists(list,row[pId])){
nodes.push(row);
}
}
var toDo = [];
for(var i=0; i<nodes.length; i++){
toDo.push(nodes[i]);
}
while(toDo.length){
var node = toDo.shift(); // the parent node
// get the children nodes
for(var i=0; i<list.length; i++){
var row = list[i];
if (row[pId] == node[myId]){
//var child = {id:row.id,text:row.name};
if (node.children){
node.children.push(row);
} else {
node.children = [row];
}
toDo.push(row);
}
}
}
return nodes;
}
var list=[
{"ids":1,"parendId":0,"name":"Foods",url:"wwww"},{"ids":2,"parentId":1,"name":"Fruits"},{"ids":3,"name":"Vegetables"},{"ids":4,"parentId":2,"name":"apple"},{"ids":5,"name":"orange"},{"ids":6,"parentId":3,"name":"tomato"},{"ids":7,"name":"carrot"},{"ids":8,"name":"cabbage"},{"ids":9,"name":"potato"},{"ids":10,"name":"lettuce"},{"ids":11,"name":"Foods"},{"ids":12,"parentId":11,{"ids":13,{"ids":14,"parentId":12,{"ids":15,{"ids":16,"parentId":13,{"ids":17,{"ids":18,{"ids":19,{"ids":20,"name":"lettuce"}
];
console.log(JSON.stringify(listToTree("ids","parentId",list)));
console.log(listToTree("ids",list));
以上这篇javascript将list转换成树状结构的实例就是小编分享给大家的全部内容了，希望能给大家一个参考，也希望大家多多支持编程之家。
原文链接：https://www.f2er.com/js/36568.html