How to use js recursion to get child node data down infinitely so as to get a new tree data?

existing data:

var res = [{
    code: 1,
    name: "",
    children: [{
        code: 1,
        name: "",
        children: [{
            code: 1,
            name: "",
            children: [{
                code: 1,
                name: ""
            }]
        }, {
            code: 1,
            name: "",
            children: [{
                code: 1,
                name: ""
            }]
        }, {
            code: 1,
            name: "",
            children: [{
                code: 1,
                name: ""
            }]
        }]
    }, {
        code: 1,
        name: "",
        children: [{
            code: 1,
            name: "",
            children: [{
                code: 1,
                name: ""
            }]
        }, {
            code: 1,
            name: "",
            children: [{
                code: 1,
                name: ""
            }]
        }]
    }]
}]

want to recursively get the data in the following format (that is, some fields that Filter does not need):

var newData = [{
    name: "",
    children: [{
        name: "",
        children: [{
            name: "",
            children: [{
                name: ""
            }]
            ...
        }]
    },{
        name: "",
        children: [{
            name: "",
            children: [{
                name: ""
            }]
            ...
        }]
    }]
}]

now I can only use nested loops to solve the problem. If you want to simplify the code or don"t know how many layers there are, nested loops certainly won"t work. How can I implement them with recursion?

Recursive javascript

Apr.09,2021

function serverArray(arr){
  for(var item = 0;item < arr.length;itemPP){
    if(arr[item].children){
      delete arr[item].code
      serverArray(arr[item].children)
    }
  }
  return arr
}
console.log(serverArray(res))

Is that what

means?

must refute "loops don't work"

function s(){
    let n = res;
    let r = [...n];
    do{
        let N_r = [];
        for(let node of r){
            delete(node["code"]);
            if(node.children){
                N_r = N_r.concat(node.children);
            }
        }
        r = N_r;
    }while(r.length);
    return n; 
}

< script type= "text/javascript" >

var json=[{
    "id": "100",
    "name": "",
    "children":[{
        "id": "1100",
        "name": "",
        "children":[{
            "id": "11001",
            "name": "",
            
        },{
            "id": "11002",
            "name": "",
            
        },{
            "id": "11003",
            "name": "",
            
        }]
    }]
  }
  ,{
    "id": "200",
    "name": "",
    "children":[{
        "id": "2100",
        "name": "",
        "children":[{
            "id": "21001",
            "name": "",
            "children":[{
                "id": "23001",
                "name": "",
            },{
                "id": "23002",
                "name": "",
            }]
        },{
            "id": "21002",
            "name": "",
            "children":[{
                "id": "22001",
                "name": "",
            },{
                "id": "22002",
                "name": "",
            }]
        }]
    }]
  }
  ];

/ / get the last child of each object in the array, provided that if there is no value in children, you cannot put an empty "children": []

 var arr1 = []
 function serverArray(arr){
  for(var item = 0;item < arr.length;itemPP){

    if(arr[item].children){
      serverArray(arr[item].children)
    }else{
        arr1.push(arr[item])
    }
  }
  return arr1
}
console.log(serverArray(json))

< / script >
data:

(7) [{ }, {. }, {. }, {. }, {. }, {. }, {. }
0: {id: "11001", name: "Xihu District"}
1: {id: "11002", name: "Upper District"}
2: {id: "11003", name: "Lower Town"}
3: {id: "23001", name: "Xiaoluo"}
4: {id: "23002", name: "Grand Luo"}
5: {id: Name: "Tiananmen"}
6: {id: "22002", name: "Red Flag"}
length: 7
_ proto__: Array (0)

Previous: C-sharp uses the HTTP protocol to call the interface, and it is common for TCP to send SYN unsuccessfully with the first handshake. what is the possible reason?

Next: The problem of webpack packaging

Js Recursive Sum 1, 2, 2, 3, 1, 2, 3, 3, 2, 3, 3, 2, 3, 2, 3, 2, 1?
js Recursive Sum 1, 2, 3, 3, 3, 3, 3, 3, 2, 1? ...

Recursive javascript

Feb.27,2021
Ask for advice on how to write a js recursive function.
work needs to use a js recursive writing, really can not write it, ask for help, you can add Wechat to send a big red packet! The data structure of trustworthiness ~ is as follows: [ { key: 1 , name: name , label: ...

Recursive javascript

Mar.12,2021
How does a recursive function return the correct value?
has the following recursive function, which cannot return the correct result: const navItems = [ { name: name1 , label: , items: [ { name: name2 , label: , items:...

Recursive javascript

Mar.13,2021
With regard to tail recursion, what is wrong with me? why is it that when the input is large, it will still overflow the stack?
as mentioned in the question, I use recursion to calculate the approximate value of PI: PI 4 = 1-1 PI 3 + 1 hand 7 + 1 hand 9 +; code is as follows: let calPI = (n, sum = 1)=> { if(n < 3) return sum*4; n%4 === 1 ? sum += 1 n...

Recursive javascript

Mar.23,2021
PHP recursive tree structure function question?
function getTree ($data, $pId) { $tree = ; -------------------1 foreach ($data as $k = > $v) { if ($v [ cate_ParentId ] = = $pId) { Father finds son $v[ cate_ParentId ] = getTree($data, $v[ cate_Id ]); ---------------------2 ...

Recursive javascript php

Apr.05,2021
Modify the property value of a multi-tier nested object according to the given string
topic description I store user information in localStorage userInfo, to encapsulate a method to modify userInfo related codes userInfof var userInfo= { id: 123 , name: Jim , info:{ address:{ home: , ...

Recursive javascript

Apr.11,2021
The Array.prototype.flat () method of the array, how to use tail recursion to achieve it?
The Array.prototype.flat () method can flatten the nested array into flattening into one-dimensional array , accept a number as several layers of expansion, and defaults to layer 1 . If you expand no matter how many layers are nested, you can pass...

Recursive javascript

Sep.16,2021
Find the points in the plane that meet the conditions (coordinate points)?
problem description The parameter is [number, distance] to find out the point coordinates satisfied in the two-bit plane of the browser. number: the number of coordinate points in the two-bit plane of the browser. distance: the distance between ea...

Recursive javascript

Nov.19,2021