JS_原生js树形无限级导航，递归

.html

<style>
    li{
        padding-left: 10px;
    }
</style>
<div id="dom"></div>

.js

var data = [
     {
         name:"前端",
         child:[
             {name:"html"},
             {name:"css"},
             {name:"js",child:[{name:"es5"},{name:"es6"},{name:"es7"}]},
         ]
     },
     {
         name:"后端",
         child:[
             {name:"php"},
             {name:"java"},
             {name:"node"},
         ]
     }
 ]

 function f(data){
     var str = "<ul>";
     for(var i=0;i<data.length;i++){
         str +="<li>"+data[i].name+"</li>";
         if(data[i].child){
             str +=f(data[i].child)
         }
     };
     str +="</ul>"
     return str;
 }
 document.getElementById("dom").innerHTML = f(data)