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


GNU libavl 2.0.1

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

Binary Search Tree Algorithms

Advancing a traverser:
 catalogue-entry-bst-17
Backing up a traverser:
 catalogue-entry-bst-18
Balancing:
 catalogue-entry-bst-27
Copying (iterative; robust):
 catalogue-entry-bst-23
Copying, iterative:
 catalogue-entry-bst-22
Copying, recursive:
 catalogue-entry-bst-21
Copying, recursive; robust, version 1:
 catalogue-entry-bst-46
Copying, recursive; robust, version 2:
 catalogue-entry-bst-47
Copying, recursive; robust, version 3:
 catalogue-entry-bst-48
Creation:
 catalogue-entry-bst-0
Deletion (iterative):
 catalogue-entry-bst-4
Deletion, by merging:
 catalogue-entry-bst-5
Deletion, special case for no left child:
 catalogue-entry-bst-40
Deletion, with data modification:
 catalogue-entry-bst-41
Destruction (by rotation):
 catalogue-entry-bst-24
Destruction, iterative:
 catalogue-entry-bst-26
Destruction, recursive:
 catalogue-entry-bst-25
Getting the current item in a traverser:
 catalogue-entry-bst-19
Initialization of traverser as copy:
 catalogue-entry-bst-15
Initialization of traverser to found item:
 catalogue-entry-bst-13
Initialization of traverser to greatest item:
 catalogue-entry-bst-12
Initialization of traverser to inserted item:
 catalogue-entry-bst-14
Initialization of traverser to least item:
 catalogue-entry-bst-11
Initialization of traverser to null item:
 catalogue-entry-bst-10
Insertion (iterative):
 catalogue-entry-bst-2
Insertion, as root:
 catalogue-entry-bst-3
Insertion, as root, of existing node in arbitrary subtree:
 catalogue-entry-bst-38
Insertion, as root, of existing node in arbitrary subtree, robustly:
 catalogue-entry-bst-39
Insertion, using pointer to pointer:
 catalogue-entry-bst-36
Join, iterative:
 catalogue-entry-bst-49
Join, recursive:
 catalogue-entry-bst-31
Refreshing of a traverser (general):
 catalogue-entry-bst-9
Refreshing of a traverser, optimized:
 catalogue-entry-bst-45
Replacing the current item in a traverser:
 catalogue-entry-bst-20
Rotation, left:
 catalogue-entry-bst-35
Rotation, left double:
 catalogue-entry-bst-32
Rotation, right:
 catalogue-entry-bst-34
Rotation, right double:
 catalogue-entry-bst-33
Search:
 catalogue-entry-bst-1
Traversal (iterative; convenient, reliable):
 catalogue-entry-bst-16
Traversal, iterative:
 catalogue-entry-bst-7
Traversal, iterative; convenient:
 catalogue-entry-bst-8
Traversal, iterative; convenient, reliable:
 catalogue-entry-bst-44
Traversal, iterative; with dynamic stack:
 catalogue-entry-bst-43
Traversal, level order:
 catalogue-entry-bst-37
Traversal, recursive:
 catalogue-entry-bst-6
Traversal, recursive; with nested function:
 catalogue-entry-bst-42
Vine compression:
 catalogue-entry-bst-30
Vine from tree:
 catalogue-entry-bst-28
Vine to balanced tree:
 catalogue-entry-bst-29


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

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