在 javascript 中使用数组和 json

我确信代码远非最优的理想，但现在不能闲着想更长的时间）

输出是一个与输入类型相同的对象，但具有递归堆叠的子对象。在数组的根部，对于给定的数据，只有三个对象，编号为 1、2 和 2.2.1.2.1.2（一个孤儿，唉）。

var data = {"Data": [{"Uzel": "asd","Number": "1","Parent": "0","Update": "3"},{"Uzel": "asd","Number": "1.1","Parent": "1","Update": "2"},{"Uzel": "asd","Number": "2.2.1.2.1.2","Parent": "2.2.1.2.1","Update": "0"},{"Uzel": "asd","Number": "1.1.1","Parent": "1.1","Update": "2"},{"Uzel": "asd","Number": "1.1.2","Parent": "1.1","Update": "0"},{"Uzel": "zxc","Number": "1.1.3","Parent": "1.1","Update": "0"},{"Uzel": "ert","Number": "1.1.4","Parent": "1.1","Update": "0"},{"Uzel": "fgh","Number": "1.2","Parent": "1","Update": "0"},{"Uzel": "cvb","Number": "1.2.1","Parent": "1.2","Update": "0"},{"Uzel": "2012 год ","Number": "1.2.2","Parent": "1.2","Update": "0"},{"Uzel": "uio","Number": "1.2.3","Parent": "1.2","Update": "0"},{"Uzel": "2014 год ","Number": "1.2.4","Parent": "1.2","Update": "0"},{"Uzel": "xxx","Number": "1.2.5","Parent": "1.2","Update": "0"},{"Uzel": "xxx","Number": "1.3","Parent": "1","Update": "0"},{"Uzel": "zzz","Number": "1.3.1","Parent": "1.3","Update": "0"},{"Uzel": "aaa","Number": "1.3.2","Parent": "1.3","Update": "0"},{"Uzel": "qqq","Number": "1.3.3","Parent": "1.3","Update": "0"},{"Uzel": "vvv","Number": "1.3.4","Parent": "1.3","Update": "0"},{"Uzel": "vvv","Number": "1.4","Parent": "1","Update": "0"},{"Uzel": "www","Number": "1.4.1","Parent": "1.4","Update": "0"},{"Uzel": "eee","Number": "1.4.2","Parent": "1.4","Update": "0"},{"Uzel": "uuu","Number": "1.4.3","Parent": "1.4","Update": "0"},{"Uzel": "iii","Number": "1.4.4","Parent": "1.4","Update": "0"},{"Uzel": "ttt","Number": "1.4.5","Parent": "1.4","Update": "0"},{"Uzel": "uuu","Number": "1.4.6","Parent": "1.4","Update": "0"},{"Uzel": "nnn","Number": "1.5","Parent": "1","Update": "0"},{"Uzel": "ooo","Number": "1.5.1","Parent": "1.5","Update": "0"},{"Uzel": "nnn","Number": "1.5.2","Parent": "1.5","Update": "0"},{"Uzel": "ppp","Number": "1.5.3","Parent": "1.5","Update": "0"},{"Uzel": "bbb","Number": "1.5.4","Parent": "1.5","Update": "0"},{"Uzel": "fff","Number": "1.5.5","Parent": "1.5","Update": "0"},{"Uzel": "jjj","Number": "1.5.6","Parent": "1.5","Update": "0"},{"Uzel": "lll","Number": "2","Parent": "0","Update": "0"},{"Uzel": "mmm","Number": "2.1","Parent": "2","Update": "0"},{"Uzel": "eee","Number": "2.1.1","Parent": "2.1","Update": "0"},{"Uzel": "rrr","Number": "2.1.1.1","Parent": "2.1.1","Update": "0"},{"Uzel": "opop","Number": "2.1.1.1.1","Parent": "2.1.1.1","Update": "0"},{"Uzel": "asd","Number": "2.1.1.1.2","Parent": "2.1.1.1","Update": "0"},{"Uzel": "asd","Number": "2.1.1.1.3","Parent": "2.1.1.1","Update": "0"},{"Uzel": "asd","Number": "2.1.1.2","Parent": "2.1.1","Update": "0"},{"Uzel": "asd","Number": "2.1.1.2.1","Parent": "2.1.1.2","Update": "0"},{"Uzel": "fgh","Number": "2.1.1.2.2","Parent": "2.1.1.2","Update": "0"},{"Uzel": "tyu","Number": "2.1.1.3","Parent": "2.1.1","Update": "0"},{"Uzel": "uio","Number": "2.1.1.4","Parent": "2.1.1","Update": "0"},{"Uzel": "zxc","Number": "2.1.1.5","Parent": "2.1.1","Update": "0"},{"Uzel": "dsa","Number": "2.1.1.5.1","Parent": "2.1.1.5","Update": "0"},{"Uzel": "poi","Number": "2.1.2","Parent": "2.1","Update": "0"},{"Uzel": "qaxz","Number": "2.1.2.1","Parent": "2.1.2","Update": "0"},{"Uzel": "ert","Number": "2.1.2.1.1","Parent": "2.1.2.1","Update": "0"}]};
data = data.Data;

//первым проходом разложим элементы под ключи, определенные в Number
var indexedData = {};
for(var k in data){
    indexedData[data[k].Number] = data[k];
}

//здесь разложим item'ы по родителям. никакой рекурсии, все на первом уровне. 
for(var i in indexedData){
    var item = indexedData[i];
    if(indexedData[item.Parent]){
        if(!indexedData[item.Parent].children) indexedData[item.Parent].children = [];
        indexedData[item.Parent].children.push(item);
    }
}

data = {"Data": []};

//а здесь удалим из корня всех, для кого есть родитель, ведь в корне должны остаться только старшие элементы иерархии.
//т.к. удаляем одним проходом, то складываем удаленные ключи в массив и на следующих итерациях проверяем наличие и в нем.
//благодаря ссылочной работе JS, из первого уровня удалятся ссылки на item'ы, но они останутся в иерархии объектов на своих правильных местах. 
var deletedKeys = [];
for(var i in indexedData){
    if(indexedData[indexedData[i].Parent] || deletedKeys.indexOf(indexedData[i].Parent) !== -1){
        deletedKeys.push(i);
        delete indexedData[i];
    } else {
        data.Data.push(indexedData[i]);
    }
}

console.log('data: ', data);