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


GNU libavl 2.0.1

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

15.1 Data Types

A PAVL tree node has a parent pointer and an AVL balance field in addition to the usual members needed for any binary search tree:

 
/* An PAVL tree node. */
struct pavl_node 
{ struct pavl_node *pavl_link[2]; /* Subtrees. */ struct pavl_node *pavl_parent; /* Parent node. */ void *pavl_data; /* Pointer to data. */ signed char pavl_balance; /* Balance factor. */ };
This code is included in @refalso{519

The other data structures are the same as the corresponding ones for TBSTs.


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