How to split a tree on all possible subtrees?

Question

I'm trying to build an iterator on JS that will take a tree and on each iteration return next possible subtree.

Here is an example of source tree:

{
  name: 'A',
  children: [
    {
      name: 'B',
      children: [
        {
          name: 'E'
        },
        {
          name: 'F'
        },
      ]
    },
    {
      name: 'C',
    }
  ]
}

The result should be three iterations

1. {
  name: 'A',
  children: [ 
    { 
      name: 'B', 
      children: [ 
        {
          name: 'E'
        } 
      ]
    }
  ]
}

2. {
  name: 'A',
  children: [ 
    { 
      name: 'B', 
      children: [ 
        {
          name: 'F'
        } 
      ]
    }
  ]
}

3. {
  name: 'A',
  children: [ 
    { 
      name: 'C', 
    }
  ]
}

Could someone give me a hint or point to the right direction of how this problem could be solved?

Thanks!

You mean to say you want all possible paths from the root to the leaf of the tree ? — abhishekkannojia, Nov 09 '16 at 13:04

score 0 · Answer 1 · answered Nov 09 '16 at 13:27

This will be help you.

var arry=[];
var obj={
  name: 'A',
  children: [
    {
      name: 'B',
      children: [
        {
          name: 'E'
        },
        {
          name: 'F'
        },
      ]
    },
    {
      name: 'C',
    }
  ]
};
    for(i=0;i<obj.children.length;i++)
    {
    var newObj={name:obj.name,children:[{name:obj.children[i].name}]};
    if(obj.children[i].children){
       for(j=0;j<obj.children[i].children.length;j++)
       {
         var newObj={name:obj.name,children:[{name:obj.children[i].name,children:          []}]};
         newObj.children[i].children[0]= {name: obj.children[i].children[j].name};
         arry.push(newObj);
      }
}
     else{
        arry.push(newObj);
     }
}
for(k=0;k<arry.length;k++){
    console.log(arry[k]);
}

<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script>

score 0 · Accepted Answer · answered Nov 09 '16 at 13:37

I think recursive function is your answer.

Something like this?

(It worked using your example)

var newtrees = [];

var getTreeFromPath = function(path) {
   var newtree = {};
   var next = newtree;
   for (var i = 0 ; i < path.length;i++) {
       next.name = path[i].name;
       if (path[i].children) {
          var nextIteration = {};
          next.children = [nextIteration];
       }
       next = nextIteration;
   }
   return newtree;

}
var iterateNode = function(node, pathToNode) {
   if (!node.children) { 
       pathToNode.push(node);
       newtrees.push(getTreeFromPath(pathToNode));
   } else {
       pathToNode.push(node);
       for (var i = 0;i < node.children.length;i++) {

          iterateNode(node.children[i], pathToNode);
       }
   }
};
iterateNode(tree, []);

Thank you very much. I've tried recursion but the key point was getTreeFromPath function. It works as you suggested, I just reimplemented it using generators: http://jsbin.com/gojisapica/edit?js,console — Dimitry, Nov 09 '16 at 15:59

How to split a tree on all possible subtrees?

2 Answers2