public List <EdgeNode> getLeaveNodes() { List <EdgeNode> list = new List <EdgeNode>(); if (!root.getHasSons()) { list.Add(root); return(list); } else { list.AddRange(root.getLeaveNodes()); } return(list); }
public List <EdgeNode> getLeaveNodes() { List <EdgeNode> leaves = new List <EdgeNode>(); if (!leftSon.getHasSons()) { leaves.Add(leftSon); } else { leftSon.getLeaveNodes(); } if (!rightSon.getHasSons()) { leaves.Add(rightSon); } else { rightSon.getLeaveNodes(); } return(leaves); }