www.delorie.com/gnu/docs/avl/libavl_140.html   search  
 
Buy GNU books!


GNU libavl 2.0.1

[ < ] [ > ]   [ << ] [ Up ] [ >> ]         [Top] [Contents] [Index] [ ? ]

8.8.3 Starting at the Last Node

 
void *
tbst_t_last (struct tbst_traverser *trav, struct tbst_table *tree)
{ assert (tree != NULL && trav != NULL); trav-&#62;tbst_table = tree; trav-&#62;tbst_node = tree-&#62;tbst_root; if (trav-&#62;tbst_node != NULL)
{ while (trav-&#62;tbst_node-&#62;tbst_tag[1] == TBST_CHILD) trav-&#62;tbst_node = trav-&#62;tbst_node-&#62;tbst_link[1]; return trav-&#62;tbst_node-&#62;tbst_data; } else
return NULL; }
This code is included in @refalso{268


  webmaster   donations   bookstore     delorie software   privacy  
  Copyright 2003   by The Free Software Foundation     Updated Jun 2003