扁平數組和樹形結構的相互轉換

引言

最近接手一個項目中不少地方須要用到樹形結構表格等，所以本身封了個VUE的樹和表格組件，須要常常對兩種形式的數據進行相互轉換，這裏記錄下轉換的方法，組件等有時間再完善下也發上來。

扁平數組轉換爲樹形結構

這個是最經常使用的，當咱們從後臺獲取一個扁平數組的時候，一般好比用id、pid來標識父子關係，如：

var arr = [{id: 1, pid: '-1'},{id: 11, pid: '1'},{id: 12, pid: '1'}]

用map記錄的方法是最經常使用效果也最好的複雜度是O(nlgn),支持多個根節點:

function listToTree(list) {
    var map = {}, node, tree= [], i;
    for (i = 0; i < list.length; i ++) {
        map[list[i].id] = list[i]; 
        list[i].children = []; 
    }
    for (i = 0; i < list.length; i += 1) {
        node = list[i];
        if (node.pid !== '-1') {
            map[node.pid].children.push(node);
        } else {
            tree.push(node);
        }
    }
    return tree;
}

listToTree(arr); //[{"id":1,"pid":"-1","children":[{"id":11,"pid":"1","children":[]},{"id":12,"pid":"1","children":[]}]}]

可是項目中有個需求，在後臺沒有返回給帶層級信息level的時候，須要用到層級信息，這樣轉換無法計算出層級，所以就須要用迭代的方法了，默認根節點層級爲0，依次遞增：

function listToTreeWithLevel(list, parent, level) {
    var out = []
    for (var node of list) {  
            if (node.pid == parent) {
                node.level = level;
                var children = listToTreeWithLevel(list, node.id, level + 1)
                if (children.length) {
                    node.children = children
                }
                out.push(node)
            }
    }
    return out
}

listToTreeWithLevel(arr, '-1', 0) //[{"id":1,"pid":"-1","children":[{"id":11,"pid":"1","children":[],"level":1},{"id":12,"pid":"1","children":[],"level":1}],"level":0}]

樹形結構轉換爲扁平數組

這個其實就是數據結構中的廣度優先遍歷：

function treeToList(tree) {
  var queen = [];
  var out = [];
  queen = queen.concat(tree);
  while(queen.length) {
      var first = queen.shift();
    if (first.children) {
        queen = queen.concat(first.children)
      delete first['children'];
    }
    
    out.push(first);
  }
  return out;
}

var tree = [{"id":1,"pid":"-1","children":[{"id":11,"pid":"1","children":[]},{"id":12,"pid":"1","children":[]}]}];
treeToList(tree) //[{"id":1,"pid":"-1"},{"id":11,"pid":"1"},{"id":12,"pid":"1"}]

參考資料

• listtotree
• 找本數據結構看看dfs和bfs