/*
- * Jalview - A Sequence Alignment Editor and Viewer
- * Copyright (C) 2007 AM Waterhouse, J Procter, G Barton, M Clamp, S Searle
- *
+ * Jalview - A Sequence Alignment Editor and Viewer (Version 2.4)
+ * Copyright (C) 2008 AM Waterhouse, J Procter, G Barton, M Clamp, S Searle
+ *
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
- *
+ *
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
- *
+ *
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
* @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);
}