/* Check whether a tnode 'n' is "full", i.e. it is an internal node and no bits are skipped. See discussion in dyntree paper p. 6  */
static int tnode_full(const struct tnode *tn, const struct node *n)
/* Check whether a tnode 'n' is "full", i.e. it is an internal node and no bits are skipped. See discussion in dyntree paper p. 6  */
static int tnode_full(const struct tnode *tn, const struct node *n)
{
	if (n == NULL || IS_LEAF(n))
		return 0;
	return ((struct tnode *) n)->pos == tn->pos + tn->bits;
}