Recursive Filter on Tree Dict (JSON)

filter_tree.js

outline = [{
          id: 1,
          children: [{
            id: 3,
            label: 'goodbye',
            children: []
          }],
          label: 'hello'
        },
        {
          id: 2,
          children: [{
            id: 9,
            label: 'mama',
            children: []
          }],
          label: 'dada'
        }];

function searchTree(treeArr, searchId){
    
     var arr = []
     
     for (nodeIndex in treeArr) {
         var node = treeArr[nodeIndex];
                
         if (node.id == searchId) {
           console.log("Macth. Ignoring", node.id);
         } else {
            
           if (node.children.length > 0) {
             
             var newChildren = searchTree(node.children, searchId, node);
             node.children = newChildren;
             arr.push(node);
             
           } else {
             arr.push(node);
             return arr;
           }
             
         
         }
              
     }
    
     return arr;

}

a = searchTree(outline, 9)
console.log(a)

lazy_filter.js

// Lazy. Scan entire tree and filter any nodes that match
function deleteNodeFromTree(obj, removeNodeId) {     
    obj.children = obj.children.filter(item => item.id != removeNodeId);
    for (nodeIndex in obj.children) { 
        deleteNodeFromTree(obj.children[nodeIndex], removeNodeId, parentNodeId);
    }
}