making combinations from each leaf to parent node in Matlab

Hello, I have to make all combinations from a tree, starting from parent node and ends at the last leaf nodes. The depth of all leaf nodes is same. I don't understand how can i get such a combination... starting from parent node ending to the leaf node.

Can anyone help please.

[Guillaume]

Please use Comment on this question instead of starting new answers.

How is your tree stored in matlab?

[Sohaib Bin Altaf]

you can see the code and picture attached to this comment, although the picture does not show the complete tree but just to give you an idea, thanks for your kind response, i hope you can help me

t = tree(Ap1)

%i=2;

for i=1:length(C{1})

      [t node(i)] = t.addnode(1, C{1}(i,:))
  disp(t.tostring)
  end

%i=1;

disp(t.tostring)

jjj=1

for x=2:length(C)
for y=1:length(C{x})
    jjj=jjj+1
for z=1:length(C{x}{y})

       [t node(i)] = t.addnode(jjj, C{x}{y}(z,:))
  i=i+1;
  disp(t.tostring)
  end
  end
  end

[Sohaib Bin Altaf]

what i require is in the attached picture, all the combinations like the one shown

[Guillaume]

Where does the tree class come form? As far as I know there's no such thing in any matlab toolbox.

[Sohaib Bin Altaf]

I followed this article, i was able to construct my required tree but unable to extract the branches which i need,

http://tinevez.github.io/matlab-tree/index.html

Answer 1

[Steven Lord]

Consider building your tree as a graph. You could create the adjacency matrix or the edge lists as shown on that page or you could start with an empty graph and use addedge to add edges (either one at a time, or from a parent to each of its children, or in some other grouping.)

As you add edges, you can plot the resulting graph to see how it is growing. The rmedge function may help if you accidentally add the wrong edge.

[Sohaib Bin Altaf]

thanks a lot for your suggestion, i will try graphs this time. I hope it solves my problem.