usr/kevin/code/develop/ffs_tree_node.c
void ffs_tree_node_remove(ffs_tree_node_t * p) {

  assert(p);

  if (p->nextsibling) ffs_tree_node_remove(p->nextsibling);
  if (p->leftchild) ffs_tree_node_remove(p->leftchild);

  /* Remove data as necessary */

  ffs_tree_node_free(p);

  return;
}
/*****************************************************************************
 *
 *  ffs_tree_node_remove
 *
 *  Recursively remove any siblings, children, and finally the node itself.
 *
 *****************************************************************************/
ffs_tree_node_remove
Recursively remove any siblings, children, and finally the node itself.
ffs_tree_node_remove Recursively remove any siblings children and finally the node itself .
void ffs_tree_node_remove(ffs_tree_node_t * p) {
  assert(p);
  if (p->nextsibling) ffs_tree_node_remove(p->nextsibling);
  if (p->leftchild) ffs_tree_node_remove(p->leftchild);
  ffs_tree_node_free(p);
  return;
}
void ffs_tree_node_remove ( ffs_tree_node_t * p ) { assert ( p ) ; if ( p -> nextsibling ) ffs_tree_node_remove ( p -> nextsibling ) ; if ( p -> leftchild ) ffs_tree_node_remove ( p -> leftchild ) ; ffs_tree_node_free ( p ) ; return ; }
ffs_tree_node_remove
  Recursively remove any siblings, children, and finally the node itself.
ffs_tree_node_remove Recursively remove any siblings children and finally the node itself .
/* Remove data as necessary */