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


GNU libavl 2.0.1

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

Binary Search Tree with Parent Pointers Algorithms

Advancing a traverser:
 catalogue-entry-pbst-6
Backing up a traverser:
 catalogue-entry-pbst-7
Balancing (with later parent updates):
 catalogue-entry-pbst-9
Balancing, with integrated parent updates:
 catalogue-entry-pbst-12
Copying:
 catalogue-entry-pbst-8
Deletion:
 catalogue-entry-pbst-1
Initialization of traverser to found item:
 catalogue-entry-pbst-4
Initialization of traverser to greatest item:
 catalogue-entry-pbst-3
Initialization of traverser to inserted item:
 catalogue-entry-pbst-5
Initialization of traverser to least item:
 catalogue-entry-pbst-2
Insertion:
 catalogue-entry-pbst-0
Rotation, left:
 catalogue-entry-pbst-16
Rotation, right:
 catalogue-entry-pbst-15
Update parent pointers:
 catalogue-entry-pbst-11
Vine compression (with parent updates):
 catalogue-entry-pbst-14
Vine to balanced tree (without parent updates):
 catalogue-entry-pbst-10
Vine to balanced tree, with parent updates:
 catalogue-entry-pbst-13


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