Buy GNU books!
|[ < ]||[ > ]||[ << ]||[ Up ]||[ >> ]||[Top]||[Contents]||[Index]||[ ? ]|
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:
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|