/** * Computes size of the tree. * * @return the number of nodes */ protected int numNodes() { if (m_Attribute == -1) { return 1; } else { int size = 1; for (Tree m_Successor : m_Successors) { size += m_Successor.numNodes(); } return size; } }
/** * Computes size of the tree. * * @return the number of nodes */ protected int numNodes() { if (m_Attribute == -1) { return 1; } else { int size = 1; for (Tree m_Successor : m_Successors) { size += m_Successor.numNodes(); } return size; } }
/** * Computes size of the tree. * * @return the number of nodes */ public int numNodes() { return m_Tree.numNodes(); }
/** * Computes size of the tree. * * @return the number of nodes */ public int numNodes() { return m_Tree.numNodes(); }