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


GNU libavl 2.0.1

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

Index: D -- L

Jump to:   A   B   C   D   E   F   G   H   I   L   M   N   O   P   R   S   T   U   V   W   X  

Index Entry Section

D
default memory allocation functions3.5 Memory Allocation
default memory allocator header3.5 Memory Allocation
delete BST nodeImplementation
delete BST node by merging5.8.1 Aside: Deletion by Merging
delete item from AVL tree6.5.2 Step 2: Delete
delete item from AVL tree6.5.2 Step 2: Delete
delete item from PAVL tree15.5.1 Step 2: Delete
delete item from PRB tree16.4.1 Step 2: Delete
delete item from RB tree7.5.1 Step 2: Delete
delete item from RB tree, alternate versionSection 6.5.1
delete item from RB tree, alternate versionSection 6.5.1
delete item from RB tree, alternate versionSection 6.5.1
delete item from TAVL tree9.5.2 Step 2: Delete
delete item from TAVL tree, with stackSection 8.5.6
delete item from TRB tree10.4.2 Step 2: Delete
delete PBST node14.4 Deletion
delete RTAVL node12.5.2 Step 2: Delete
delete RTAVL node, right-lookingSection 11.5.4
delete RTBST node, left-looking11.5.2 Left-Looking Deletion
delete RTBST node, right-looking11.5.1 Right-Looking Deletion
delete RTRB node13.4.1 Step 2: Delete
delete TBST node8.7 Deletion
delete_order enumeration5.14.2 Test Set Generation
destroy a BST iteratively5.11.3 Aside: Iterative Destruction
destroy a BST recursively5.11.2 Aside: Recursive Destruction

E
ensure w is black in left-side PRB deletion rebalancingCase Reduction: Ensure w is black
ensure w is black in left-side RB deletion rebalancingCase Reduction: Ensure w is black
ensure w is black in left-side TRB deletion rebalancingCase Reduction: Ensure w is black
ensure w is black in right-side PRB deletion rebalancing16.4.4 Symmetric Case
ensure w is black in right-side RB deletion rebalancing7.5.4 Symmetric Case
ensure w is black in right-side TRB deletion rebalancing10.4.5 Symmetric Case
error_node variableSection 4.10.1

F
fail function5.14.6 Utility Functions
fallback_join functionSection 4.13
find BST node to deleteImplementation
find BST node to delete by merging5.8.1 Aside: Deletion by Merging
find parent of a TBST node9.5.6 Finding the Parent of a Node
find PBST node to delete14.4 Deletion
find PBST node to delete14.4 Deletion
find predecessor of RTBST node with left child11.6.5 Backing Up to the Previous Node
find predecessor of RTBST node with no left child11.6.5 Backing Up to the Previous Node
find RTBST node to delete11.5 Deletion
find TBST node to delete8.7 Deletion
find TBST node to delete, with parent node algorithmSection 7.7
find_parent function9.5.6 Finding the Parent of a Node
finish up after BST deletion by merging5.8.1 Aside: Deletion by Merging
finish up after deleting BST nodeImplementation
finish up after deleting PBST nodeCase 3: p's right child has a left child
finish up after deleting RTBST node11.5 Deletion
finish up after deleting TBST nodeCase 4: p's right child has a left child
finish up after PRB deletion16.4.3 Step 4: Finish Up
finish up after RB deletion7.5.3 Step 4: Finish Up
finish up after RTRB deletion13.4.3 Step 4: Finish Up
finish up after TRB deletion10.4.4 Step 4: Finish Up
finish up and return after AVL deletion6.5.5 Step 5: Finish Up
first_item function5.9.2.1 Improving Convenience
found insertion point in recursive AVL insertion6.4.7 Aside: Recursive Insertion

G
gen_balanced_tree functionSection 4.14.2
gen_deletions functionSection 4.14.2
gen_insertions functionSection 4.14.2
generate permutation for balanced treeSection 4.14.2
generate random permutation of integersSection 4.14.2

H
handle case where x has a right child5.9.3.7 Advancing to the Next Node
handle case where x has no right child5.9.3.7 Advancing to the Next Node
handle stack overflow during BST traversalSection 4.9.2.1
handle_long_option functionB.1 Option Parser
handle_short_option functionB.1 Option Parser

I
initialize search test arraySection 3.5
initialize smaller and larger within binary search treeSection 3.6
insert AVL node6.4.2 Step 2: Insert
insert n into arbitrary subtreeSection 4.7.1
insert new BST node, root insertion version5.7.1 Aside: Root Insertion
insert new node into RTBST tree11.4 Insertion
insert PAVL node15.4.1 Steps 1 and 2: Search and Insert
insert PBST node14.3 Insertion
insert PRB node16.3.1 Step 2: Insert
insert RB node7.4.2 Step 2: Insert
insert RTAVL node12.4.1 Steps 1--2: Search and Insert
insert RTRB node13.3.1 Steps 1 and 2: Search and Insert
insert TAVL node9.4.1 Steps 1 and 2: Search and Insert
insert TBST node8.6 Insertion
insert TRB node10.3.1 Steps 1 and 2: Search and Insert
insert_order enumeration5.14.2 Test Set Generation
insertion and deletion order generationSection 4.14.2
intermediate step between bst_copy_recursive_2() and bst_copy_iterative()Section 4.10.2
iter variableSection 4.9.2.1
iter variableSection 4.9.2.1
iterative copy of BST5.10.2 Iterative Copying
iterative copy of BST5.10.2 Iterative Copying
iterative copy of BST5.10.2 Iterative Copying
iterative copy of BST5.10.2 Iterative Copying
iterative traversal of BST, take 15.9.2 Traversal by Iteration
iterative traversal of BST, take 25.9.2 Traversal by Iteration
iterative traversal of BST, take 35.9.2 Traversal by Iteration
iterative traversal of BST, take 45.9.2 Traversal by Iteration
iterative traversal of BST, take 55.9.2 Traversal by Iteration
iterative traversal of BST, take 65.9.2.1 Improving Convenience
iterative traversal of BST, take 65.9.2.1 Improving Convenience
iterative traversal of BST, take 65.9.2.1 Improving Convenience
iterative traversal of BST, with dynamically allocated stackSection 4.9.2

L
left-side rebalancing after initial-black RB insertion7.4.5 Aside: Initial Black Insertion
left-side rebalancing after PRB deletion16.4.2 Step 3: Rebalance
left-side rebalancing after PRB insertion16.3.2 Step 3: Rebalance
left-side rebalancing after RB deletion7.5.2 Step 3: Rebalance
left-side rebalancing after RB insertion7.4.3 Step 3: Rebalance
left-side rebalancing after RTRB deletion13.4.2 Step 3: Rebalance
left-side rebalancing after RTRB insertion13.3.2 Step 3: Rebalance
left-side rebalancing after TRB deletion10.4.3 Step 3: Rebalance
left-side rebalancing after TRB insertion10.3.2 Step 3: Rebalance
left-side rebalancing case 1 in AVL deletionCase 1: x has - balance factor
left-side rebalancing case 1 in PAVL deletionCase 1: x has - balance factor
left-side rebalancing case 2 in AVL deletionCase 2: x has + or 0 balance factor
left-side rebalancing case 2 in PAVL deletionCase 2: x has + or 0 balance factor
level-order traversalSection 4.7
libavl_allocator structure3.5 Memory Allocation
license2.4 License

Jump to:   A   B   C   D   E   F   G   H   I   L   M   N   O   P   R   S   T   U   V   W   X  


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

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