@Override
	public int getGrade(Node<T> n) {
		if (safety && !contains(n)) {
			throw new NodeNotFoundException();
		} else if (n == null) {
			return 0;
		}
		int c = 0;
		Iterator<Node<T>> children = children(n);
		while (children.hasNext()) {
			children.next();
			c++;
		}
		return c;
	}