javascript - 递归迭代结构

Question

我有以下结构:

var struct = [{
    "name": "Name1",
    "type": "type1",
    "children": [{
        "name": "Name11",
        "type": "type1",
        "children": [{
            "name": "Name111",
            "type": "type1"
            },
            {
            "name": "Name112",
            "type": "type2"
            }
        }]
    }]
}];

我想遍历类型等于 type1 的所有名称类型元素并创建一个 <option>每个元素的元素。

所以它会是这样的:

var iterate = function (data) {
   var elements = [];
   for (var i in data) {
      if (data[i].type == 'type1') {
         var option = document.createElement('option');
         option.innerHTML = data[i].name;
         elements.push(option);
         elements.push(iterate(data[i].children));
      }
   }
   return elements;
};

然而，它给了我错误的结果。而且可能效率很低。我应该如何正确执行此操作？

Answer 1

您可以使用迭代递归方法来获取嵌套数据。

function getElements(data) {
    var elements = [];
    data.forEach(function iter(a) {
        var option;
        if (a.type === 'type1') {
            option = document.createElement('option');
            option.innerHTML = a.name;
            elements.push(option);
            Array.isArray(a.children) && a.children.forEach(iter); // assuming only 
        }                                                          // type1 branches
    });                                                            // to iterate
    return elements;
}

var struct = [{ "name": "Name1", "type": "type1", "children": [{ "name": "Name11", "type": "type1", "children": [{ "name": "Name111", "type": "type1" }, { "name": "Name112", "type": "type2" }] }] }];

console.log(getElements(struct));