Bug: mtree_getAllLeftRightChildren does not get all children

[Schlevidon]

Bug description

The helper function mtree_getAllLeftRightChildren_recursion terminates immediately if any node in the subtree has no children.

ifdiff/mtree_getAllLeftRightChildren_recursion.m

Lines 18 to 25 in 7b4342a

	for i = 1:length(childs)
	z = childs(i);
	childs_new = mtreeobj.T(z, connection_possiblities);
	if ~any(childs_new(:))
	% stop function when node has no childs at all
	return
	end

Instead, the function should only terminate, if all nodes have no further children.