* @return Vector of leaf nodes on binary tree
*/
public Vector findLeaves(SequenceNode node, Vector leaves)
- {
+ {
if (node == null)
{
return leaves;
}
- if ( (node.left() == null) && (node.right() == null))
+ if ( (node.left() == null) && (node.right() == null)) // Interior node detection
{
leaves.addElement(node);
}
else
{
+/* TODO: Identify internal nodes... if (node.isSequenceLabel())
+ {
+ leaves.addElement(node);
+ }*/
findLeaves( (SequenceNode) node.left(), leaves);
findLeaves( (SequenceNode) node.right(), leaves);
}