This is libavl.info, produced by makeinfo version 4.8 from libavl.texi.


Indirect:
libavl.info-1: 73
libavl.info-2: 299525
libavl.info-3: 602158
libavl.info-4: 907182

Tag Table:
(Indirect)
Node: Top73
Node: Preface771
Node: Acknowledgements2921
Node: Contacting the Author4131
Node: Introduction4964
Node: Audience5682
Node: Reading the Code8362
Node: Code Conventions13368
Node: Licenses13942
Ref: 114376
Ref: 215719
Node: The Table ADT16853
Node: Informal Definition17864
Node: Identifiers20207
Ref: Identifiers-Footnote-122570
Node: Comparison Function22731
Ref: 323760
Ref: 424854
Ref: strictweakordering26489
Ref: ternarycompare27299
Node: Item and Copy Functions28026
Ref: 528317
Node: Memory Allocation29092
Ref: 629880
Ref: 731033
Ref: 831885
Ref: libavlallocator32265
Ref: tblallocatorabort32532
Ref: moreargs32724
Node: Creation and Destruction33008
Ref: 933255
Node: Count35364
Ref: 1035574
Ref: tblcount35730
Node: Insertion and Deletion35906
Ref: 1137313
Ref: nullinsert39625
Ref: genericinsertreplace39910
Node: Assertions40026
Ref: 1240709
Ref: tblassert41270
Ref: genericassertions41430
Node: Traversers41832
Node: Constructors43849
Ref: 1344148
Node: Manipulators46081
Ref: 1446253
Node: Table Headers48970
Ref: 1549227
Ref: 1649544
Node: Additional Exercises for Tables50193
Node: Search Algorithms50697
Node: Sequential Search51697
Ref: 1752552
Node: Sequential Search with Sentinel53913
Ref: 1855208
Node: Sequential Search of Ordered Array58001
Ref: 1959179
Node: Sequential Search of Ordered Array with Sentinel60533
Ref: 2061069
Ref: 2162524
Node: Binary Search of Ordered Array63181
Ref: 2266669
Ref: benchmark69755
Ref: Binary Search of Ordered Array-Footnote-170142
Node: Binary Search Tree in Array70570
Ref: 2372369
Ref: 2474112
Node: Dynamic Lists75466
Ref: Dynamic Lists-Footnote-177802
Node: Binary Search Trees77989
Ref: 2578698
Ref: 2679152
Ref: includeguard79332
Node: BST Vocabulary79764
Node: Differing Definitions83383
Node: BST Data Types85528
Node: BST Node Structure86120
Ref: 2786584
Node: BST Structure87333
Ref: 2887630
Node: BST Maximum Height89036
Ref: 2989954
Node: BST Rotations90295
Ref: bstrotation93231
Node: BST Operations93424
Ref: 3094050
Node: Creating a BST94577
Ref: catalogue-entry-bst-094847
Ref: 3194852
Node: Searching a BST95479
Ref: catalogue-entry-bst-195779
Ref: 3295784
Node: Inserting into a BST96576
Ref: catalogue-entry-bst-298134
Ref: 3398139
Ref: rootcast99196
Ref: bstprobedblptr99313
Ref: copyinsorder99426
Ref: levelorder99676
Node: Root Insertion in a BST99909
Ref: catalogue-entry-bst-3102544
Ref: 34102549
Ref: 35102941
Ref: 36103458
Ref: 37103796
Ref: rootins1104295
Ref: rootins2105022
Node: Deleting from a BST105438
Ref: bstdelcase1106561
Ref: bstdelcase2107545
Ref: bstdelcase3108573
Ref: successor109585
Ref: catalogue-entry-bst-4110343
Ref: 38110348
Ref: 39111217
Ref: 40111655
Ref: 41112077
Ref: 42112301
Ref: 43112706
Ref: 44112994
Ref: 45113256
Ref: bstdelcase15113561
Ref: bstaltdel113668
Ref: modifydata113966
Node: Deletion by Merging114297
Ref: catalogue-entry-bst-5117468
Ref: 46117473
Ref: 47118097
Ref: 48119087
Ref: 49120179
Node: Traversing a BST120438
Ref: Traversing a BST-Footnote-1124350
Node: Recursive Traversal of a BST124556
Ref: catalogue-entry-bst-6125789
Ref: 50125794
Ref: 51126245
Node: Iterative Traversal of a BST127383
Ref: 52129971
Ref: 53130426
Ref: 54131069
Ref: 55132062
Ref: catalogue-entry-bst-7132848
Ref: 56132853
Ref: Iterative Traversal of a BST-Footnote-1134547
Node: Improving Convenience134663
Ref: 57135246
Ref: 58135699
Ref: catalogue-entry-bst-8136636
Ref: 59136641
Ref: 60137201
Ref: 61137769
Node: Better Iterative Traversal139431
Ref: 62141555
Ref: catalogue-entry-bst-9143013
Ref: 63143018
Ref: 64144141
Ref: probegeneration144734
Node: BST Traverser Null Initialization145788
Ref: catalogue-entry-bst-10146148
Ref: 65146153
Node: BST Traverser First Initialization146442
Ref: catalogue-entry-bst-11146941
Ref: 66146946
Node: BST Traverser Last Initialization147786
Ref: catalogue-entry-bst-12148207
Ref: 67148212
Node: BST Traverser Find Initialization148917
Ref: catalogue-entry-bst-13149379
Ref: 68149384
Node: BST Traverser Insert Initialization150335
Ref: catalogue-entry-bst-14150743
Ref: 69150748
Node: BST Traverser Copying151998
Ref: catalogue-entry-bst-15152344
Ref: 70152349
Node: BST Traverser Advancing153186
Ref: catalogue-entry-bst-16153843
Ref: catalogue-entry-bst-17153843
Ref: 71153848
Ref: 72154977
Ref: 73155722
Node: BST Traverser Retreating156025
Ref: catalogue-entry-bst-18156412
Ref: 74156417
Node: BST Traversal Current Item157704
Ref: catalogue-entry-bst-19157942
Ref: 75157947
Node: BST Traversal Replacing the Current Item158239
Ref: catalogue-entry-bst-20158450
Ref: 76158455
Node: Copying a BST158830
Node: Copying a BST Recursively159305
Ref: catalogue-entry-bst-21159634
Ref: 77159639
Ref: 78160598
Node: Copying a BST Iteratively162272
Ref: catalogue-entry-bst-22162703
Ref: 79162708
Ref: 80163471
Ref: 81164025
Ref: 82165210
Ref: copystep166151
Node: Handling Errors in Iterative BST Copying166253
Ref: 83168332
Ref: catalogue-entry-bst-23169310
Ref: 84169315
Node: Destroying a BST172258
Node: Destroying a BST by Rotation172679
Ref: catalogue-entry-bst-24175348
Ref: 85175353
Node: Destroying a BST Recursively176457
Ref: catalogue-entry-bst-25177145
Ref: 86177150
Node: Destroying a BST Iteratively177383
Ref: catalogue-entry-bst-26180897
Ref: 87180902
Node: Balancing a BST182172
Ref: catalogue-entry-bst-27184609
Ref: 88184614
Ref: 89184909
Node: Transforming a BST into a Vine185244
Ref: catalogue-entry-bst-28187726
Ref: 90187731
Node: Transforming a Vine into a Balanced BST188357
Ref: Transforming a Vine into a Balanced BST-Footnote-1193697
Node: Balancing General Trees193876
Node: Balancing Implementation196861
Ref: catalogue-entry-bst-29197167
Ref: 91197172
Ref: 92199361
Ref: 93199899
Ref: 94200824
Ref: 95201453
Node: Implementing Compression201708
Ref: catalogue-entry-bst-30202107
Ref: 96202112
Node: Joining BSTs202824
Ref: catalogue-entry-bst-31208998
Ref: 97209003
Ref: Joining BSTs-Footnote-1210067
Node: Testing BST Functions210148
Ref: 98213942
Ref: 99214525
Ref: 100215071
Ref: Testing BST Functions-Footnote-1215698
Node: Testing BSTs215906
Ref: 101216967
Ref: 102217845
Ref: 103218478
Ref: 104219882
Ref: 105221549
Ref: 106223148
Ref: 107224380
Ref: 108225656
Ref: 109225925
Node: BST Verification226545
Ref: 110226962
Ref: 111227946
Ref: 112228624
Ref: 113228870
Ref: 114229353
Ref: 115230325
Ref: 116230945
Ref: 117232012
Ref: 118232773
Ref: 119233818
Node: Displaying BST Structures235014
Ref: 120235822
Ref: 121236922
Node: Test Set Generation237178
Ref: 122237612
Node: Testing Overflow239582
Ref: 123240336
Ref: 124242691
Ref: 125242922
Node: Memory Manager243486
Ref: 126244064
Ref: 127245236
Ref: 128246677
Ref: 129248020
Ref: 130248990
Ref: 131249896
Ref: 132250410
Ref: 133253276
Node: User Interaction254788
Ref: 134255751
Node: Utility Functions257471
Ref: 135257850
Ref: 136258078
Ref: 137258315
Ref: 138258798
Node: Main Program259073
Ref: 139259331
Ref: 140259649
Ref: 141260911
Ref: 142264040
Node: Additional Exercises for BSTs264103
Ref: bstsentinel264285
Node: AVL Trees264667
Ref: 143267977
Ref: 144268345
Ref: AVL Trees-Footnote-1268849
Node: AVL Balancing Rule269044
Node: Analysis of AVL Balancing Rule271124
Ref: 145272535
Ref: Analysis of AVL Balancing Rule-Footnote-1272775
Node: AVL Data Types273008
Ref: 146273325
Node: AVL Operations273746
Ref: 147274356
Node: Inserting into an AVL Tree274890
Ref: catalogue-entry-avl-0277588
Ref: 148277594
Ref: 149278044
Ref: balancedspeed278838
Node: Step 1 in AVL Insertion279296
Ref: 150280192
Node: Step 2 in AVL Insertion280623
Ref: 151281141
Node: Step 3 in AVL Insertion281558
Ref: 152288906
Ref: avlinsert289570
Ref: Step 3 in AVL Insertion-Footnote-1290962
Node: Rebalancing AVL Trees291149
Ref: 153292386
Ref: 154292983
Ref: 155293468
Ref: 156293696
Ref: 157294788
Ref: catalogue-entry-bst-32296425
Ref: 158296431
Ref: ynezlink0297309
Ref: Rebalancing AVL Trees-Footnote-1297935
Node: AVL Insertion Symmetric Case298006
Ref: 159298471
Ref: 160298788
Ref: catalogue-entry-bst-33298979
Ref: 161298985
Node: AVL Insertion Example299525
Node: Recursive Insertion301414
Ref: catalogue-entry-avl-1303522
Ref: 162303528
Ref: 163304884
Ref: 164306155
Ref: 165307420
Node: Deleting from an AVL Tree307830
Ref: catalogue-entry-avl-2308819
Ref: 166308825
Node: Deleting an AVL Node Step 1 - Search309928
Ref: avldelsaveitem310751
Ref: 167310757
Node: Deleting an AVL Node Step 2 - Delete311156
Ref: 168311750
Ref: 169312497
Ref: 170312770
Ref: 171313264
Ref: 172314013
Ref: avlmodifydata314455
Node: Deleting an AVL Node Step 3 - Update314756
Ref: 173316291
Ref: 174320983
Node: Deleting an AVL Node Step 4 - Rebalance321234
Ref: 175321693
Ref: avldelcase1322052
Ref: 176322838
Ref: avldel2323117
Ref: 177324588
Node: Deleting an AVL Node Step 5 - Finish Up325295
Ref: 178325535
Node: AVL Deletion Symmetric Case325694
Ref: 179325984
Node: Traversal of an AVL Tree326747
Ref: 180327129
Ref: catalogue-entry-avl-3328064
Ref: 181328070
Ref: catalogue-entry-avl-4328740
Ref: 182328746
Ref: catalogue-entry-avl-5329354
Ref: 183329360
Ref: catalogue-entry-avl-6329970
Ref: 184329976
Ref: catalogue-entry-avl-7330824
Ref: 185330830
Ref: catalogue-entry-avl-8331916
Ref: 186331922
Node: Copying an AVL Tree333197
Ref: catalogue-entry-avl-9333557
Ref: 187333563
Node: Testing AVL Trees336284
Ref: 188336831
Ref: 189337329
Ref: 190338516
Ref: 191339817
Ref: 192340312
Ref: 193341078
Node: Red-Black Trees341349
Ref: 194342502
Ref: 195342860
Node: RB Balancing Rule343245
Ref: blackenroot347130
Node: Analysis of Red-Black Balancing Rule347753
Node: RB Data Types348549
Ref: 196348945
Ref: 197349473
Node: Operations in an RB Tree349873
Ref: 198350399
Node: Inserting into an RB Tree350971
Ref: catalogue-entry-rb-0351613
Ref: 199351619
Ref: 200351976
Node: Inserting an RB Node Step 1 - Search352720
Ref: 201353198
Node: Inserting an RB Node Step 2 - Insert353587
Ref: 202353827
Node: Inserting an RB Node Step 3 - Rebalance354252
Ref: 203356402
Ref: 204357310
Ref: rbinscase1357854
Ref: 205359227
Ref: rbinscase2359531
Ref: 206360590
Ref: rbinscase3360946
Ref: 207362227
Ref: mink3362473
Node: RB Insertion Symmetric Case362823
Ref: 208363055
Ref: 209363555
Ref: 210363745
Ref: 211364023
Node: Initial Black Insertion in an RB Tree364259
Ref: catalogue-entry-rb-1364924
Ref: 212364930
Ref: 213365989
Ref: 214366815
Ref: 215368378
Ref: 216369494
Ref: 217370719
Ref: 218370977
Ref: 219371523
Ref: 220371711
Ref: 221371994
Node: Deleting from an RB Tree372203
Ref: catalogue-entry-rb-2372787
Ref: 222372793
Node: Deleting an RB Node Step 2 - Delete373758
Ref: rbcolorswap377390
Ref: 223378150
Ref: rbdel1378594
Ref: 224378772
Ref: rbdel2378975
Ref: 225379739
Ref: rbdel3380041
Ref: 226381083
Ref: noswapcolors381541
Node: Deleting an RB Node Step 3 - Rebalance381956
Ref: 227382560
Ref: 228383758
Ref: 229384749
Ref: rbdcr385541
Ref: 230386919
Ref: rbdelcase1387740
Ref: 231388863
Ref: rbdelcase2389081
Ref: 232390105
Ref: rbdelcase3390494
Ref: 233391491
Node: Deleting an RB Node Step 4 - Finish Up391792
Ref: 234392115
Node: RB Deletion Symmetric Case392312
Ref: 235392495
Ref: 236393226
Ref: 237393602
Ref: 238393754
Ref: 239394065
Node: Testing RB Trees394394
Ref: 240394706
Ref: 241395195
Ref: 242396379
Ref: 243397726
Ref: 244398017
Ref: 245398640
Ref: 246398978
Ref: 247399801
Ref: 248400009
Node: Threaded Binary Search Trees400249
Ref: 249401776
Ref: 250402154
Ref: Threaded Binary Search Trees-Footnote-1402596
Node: Threads402759
Node: TBST Data Types405602
Ref: 251406012
Ref: 252406830
Node: TBST Operations407694
Ref: 253408237
Node: Creating a TBST408785
Ref: catalogue-entry-tbst-0409062
Ref: 254409068
Node: Searching a TBST409758
Ref: catalogue-entry-tbst-1410196
Ref: 255410202
Node: Inserting into a TBST410794
Ref: catalogue-entry-tbst-2412638
Ref: 256412644
Ref: 257413125
Ref: 258413608
Node: Deleting from a TBST414281
Ref: catalogue-entry-tbst-3414801
Ref: 259414807
Ref: 260415685
Ref: 261416443
Ref: 262418483
Ref: 263419531
Ref: 264420719
Ref: 265423304
Ref: 266423619
Ref: 267423955
Ref: 268424448
Ref: tbstparent424642
Ref: ptrtaglink424833
Ref: tbstthreadsearch425255
Node: Traversing a TBST425560
Ref: 269426700
Ref: 270427276
Node: TBST Traverser Null Initialization428223
Ref: catalogue-entry-tbst-4428446
Ref: 271428452
Node: TBST Traverser First Initialization428702
Ref: catalogue-entry-tbst-5428944
Ref: 272428950
Node: TBST Traverser Last Initialization429436
Ref: catalogue-entry-tbst-6429676
Ref: 273429682
Node: TBST Traverser Find Initialization430166
Ref: catalogue-entry-tbst-7430502
Ref: 274430508
Node: TBST Traverser Insert Initialization431219
Ref: catalogue-entry-tbst-8431620
Ref: 275431626
Node: TBST Traverser Copying432217
Ref: catalogue-entry-tbst-9432436
Ref: 276432442
Node: TBST Traverser Advancing432836
Ref: catalogue-entry-tbst-10433458
Ref: 277433464
Node: TBST Traverser Retreating434181
Ref: catalogue-entry-tbst-11434370
Ref: 278434376
Node: Copying a TBST435039
Ref: catalogue-entry-tbst-12438214
Ref: 279438220
Ref: catalogue-entry-tbst-13439968
Ref: 280439974
Ref: 281440170
Ref: 282443190
Node: Destroying a TBST443896
Ref: catalogue-entry-tbst-14444456
Ref: 283444462
Node: Balancing a TBST445242
Ref: catalogue-entry-tbst-15446143
Ref: 284446149
Ref: 285446394
Node: Transforming a TBST into a Vine446718
Ref: catalogue-entry-tbst-16447550
Ref: 286447556
Node: Transforming a Vine into a Balanced TBST450363
Ref: catalogue-entry-tbst-17451005
Ref: 287451011
Ref: catalogue-entry-tbst-18454009
Ref: 288454015
Ref: 289455049
Ref: 290455316
Ref: 291455940
Node: Testing TBSTs456134
Ref: 292456965
Ref: 293457433
Ref: 294458522
Ref: 295460027
Ref: 296460817
Ref: 297461550
Ref: 298462169
Node: Threaded AVL Trees463047
Ref: 299464015
Ref: 300464410
Node: TAVL Data Types464737
Ref: 301465045
Ref: tavlnodesize465592
Node: TBST Rotations465834
Ref: tbstrot468042
Node: TAVL Operations468199
Ref: 302468591
Node: Inserting into a TAVL Tree469159
Ref: catalogue-entry-tavl-0469530
Ref: 303469536
Node: Steps 1 and 2 in TAVL Insertion470119
Ref: 304470830
Ref: 305471575
Node: Rebalancing TAVL Trees471773
Ref: 306472178
Ref: 307472836
Ref: 308473442
Ref: catalogue-entry-tavl-1476092
Ref: 309476098
Ref: tavlaltdblrot476598
Node: TAVL Insertion Symmetric Case476759
Ref: 310477026
Ref: 311477389
Ref: catalogue-entry-tavl-2477748
Ref: 312477754
Node: Deleting from a TAVL Tree478241
Ref: catalogue-entry-tavl-3478776
Ref: 313478782
Node: Deleting a TAVL Node Step 1 - Search479717
Ref: 314480180
Node: Deleting a TAVL Node Step 2 - Delete480663
Ref: 315481405
Ref: 316482273
Ref: 317482678
Ref: 318483162
Ref: 319483669
Node: Deleting a TAVL Node Step 3 - Update484148
Ref: 320485270
Node: Deleting a TAVL Node Step 4 - Rebalance485926
Ref: 321486489
Ref: 322487246
Ref: tavldelcase2487550
Ref: 323488441
Ref: tavldelcase3488736
Ref: 324490207
Node: TAVL Deletion Symmetric Case490534
Ref: 325490804
Ref: 326491620
Ref: 327491867
Ref: 328492106
Node: Finding the Parent of a TBST Node492434
Ref: catalogue-entry-tbst-19495006
Ref: 329495012
Ref: tbstrootparent496494
Ref: tbstdelstack496687
Node: Copying a TAVL Tree497059
Ref: catalogue-entry-tavl-4497389
Ref: 330497395
Ref: 331498218
Node: Testing TAVL Trees498452
Ref: 332498624
Ref: 333499145
Ref: 334500765
Node: Threaded Red-Black Trees501891
Ref: 335502457
Ref: 336502841
Node: TRB Data Types503117
Ref: 337503568
Node: TRB Operations504234
Ref: 338504689
Node: Inserting into a TRB Tree505287
Ref: catalogue-entry-trb-0505514
Ref: 339505520
Node: Steps 1 and 2 in TRB Insertion506367
Ref: 340506683
Ref: 341507354
Node: Step 3 in TRB Insertion507519
Ref: 342507833
Ref: 343508387
Ref: 344509511
Ref: 345511372
Ref: 346512571
Node: TRB Insertion Symmetric Case512862
Ref: 347513033
Ref: 348513567
Ref: 349513740
Ref: 350514042
Node: Deleting from a TRB Tree514721
Ref: catalogue-entry-trb-1514959
Ref: 351514965
Node: Deleting a TRB Node Step 1 - Search515816
Ref: 352516094
Node: Deleting a TRB Node Step 2 - Delete516545
Ref: 353517095
Ref: 354518027
Ref: 355518526
Ref: 356519121
Ref: 357519880
Node: Deleting a TRB Node Step 3 - Rebalance520983
Ref: 358521373
Ref: 359522261
Ref: 360523217
Ref: 361523549
Ref: 362524627
Ref: 363525874
Node: Deleting a TRB Node Step 4 - Finish Up526227
Ref: 364526552
Node: TRB Deletion Symmetric Case526730
Ref: 365526914
Ref: 366527687
Ref: 367527880
Ref: 368528051
Ref: 369528367
Node: Testing TRB Trees528917
Ref: 370529099
Ref: 371529609
Ref: 372531210
Ref: 373532386
Node: Right-Threaded Binary Search Trees533026
Ref: 374535409
Ref: 375535825
Ref: Right-Threaded Binary Search Trees-Footnote-1536553
Node: RTBST Data Types536843
Ref: 376537037
Node: RTBST Operations537536
Ref: 377537714
Node: Searching an RTBST538285
Ref: catalogue-entry-rtbst-0538817
Ref: 378538823
Node: Inserting into an RTBST539569
Ref: catalogue-entry-rtbst-1540115
Ref: 379540121
Ref: 380540614
Ref: 381542664
Node: Deleting from an RTBST543225
Ref: 382543819
Ref: 383544495
Ref: 384545209
Node: Right-Looking Deletion in a RTBST545520
Ref: catalogue-entry-rtbst-2545968
Ref: 385545974
Ref: 386547002
Ref: 387548151
Ref: 388548709
Ref: 389549390
Node: Left-Looking Deletion in an RTBST550336
Ref: catalogue-entry-rtbst-3551780
Ref: 390551786
Ref: 391553097
Ref: 392553428
Ref: 393554388
Ref: 394554930
Ref: 395555277
Ref: 396555621
Node: Comparing Deletion Algorithms556121
Node: Traversing an RTBST559008
Ref: 397559739
Node: RTBST Traverser First Initialization560587
Ref: catalogue-entry-rtbst-4560985
Ref: 398560991
Node: RTBST Traverser Last Initialization561490
Ref: catalogue-entry-rtbst-5561894
Ref: 399561900
Node: RTBST Traverser Find Initialization562401
Ref: catalogue-entry-rtbst-6562720
Ref: 400562726
Node: RTBST Traverser Advancing563575
Ref: catalogue-entry-rtbst-7564035
Ref: 401564041
Node: RTBST Traverser Retreating564726
Ref: catalogue-entry-rtbst-8565251
Ref: 402565257
Ref: 403567824
Ref: 404568555
Node: Copying an RTBST568846
Ref: 405569764
Ref: catalogue-entry-rtbst-9571472
Ref: 406571478
Ref: 407572529
Ref: catalogue-entry-rtbst-10572922
Ref: 408572928
Node: Destroying an RTBST573122
Ref: catalogue-entry-rtbst-11573407
Ref: 409573413
Node: Balancing an RTBST574202
Ref: catalogue-entry-rtbst-12574527
Ref: 410574533
Ref: catalogue-entry-rtbst-13574953
Ref: 411574959
Ref: catalogue-entry-rtbst-14575631
Ref: 412575637
Node: Testing RTBSTs576473
Ref: 413576674
Ref: 414577177
Ref: 415578250
Ref: 416579447
Node: Right-Threaded AVL Trees580195
Ref: 417580852
Ref: 418581257
Node: RTAVL Data Types581597
Ref: 419581994
Node: RTAVL Operations582556
Ref: 420582971
Node: RTBST Rotations583556
Ref: rtbstrot585554
Node: Inserting into an RTAVL Tree585718
Ref: catalogue-entry-rtavl-0586034
Ref: 421586040
Node: Steps 1-1 in RTAVL Insertion586595
Ref: 422587174
Ref: 423587946
Node: Rebalancing RTAVL Trees588484
Ref: 424589204
Ref: 425589923
Ref: 426590289
Ref: 427592283
Ref: 428593224
Ref: rtavlinscase2593662
Ref: 429594848
Ref: 430595862
Node: Deleting from an RTAVL Tree596267
Ref: catalogue-entry-rtavl-1596503
Ref: 431596509
Node: Deleting a RTAVL Node Step 1 - Search597380
Ref: 432597861
Node: Deleting a RTAVL Node Step 2 - Delete598557
Ref: 433599070
Ref: 434599853
Ref: 435600365
Ref: 436600825
Ref: 437601283
Ref: 438601665
Ref: 439601982
Node: Deleting a RTAVL Node Step 3 - Update602158
Ref: 440602568
Node: Deleting a RTAVL Node Step 4 - Rebalance603281
Ref: 441603848
Ref: 442604475
Ref: 443605600
Ref: 444605859
Ref: 445606441
Ref: 446606654
Ref: 447607876
Ref: 448608834
Node: Copying an RTAVL Tree610118
Ref: catalogue-entry-rtavl-2610466
Ref: 449610472
Ref: catalogue-entry-rtavl-3610714
Ref: 450610720
Node: Testing RTAVL Trees611641
Ref: 451611784
Ref: 452612316
Ref: 453613620
Node: Right-Threaded Red-Black Trees614709
Ref: 454615248
Ref: 455615642
Node: RTRB Data Types615928
Ref: 456616311
Node: RTRB Operations617006
Ref: 457617325
Node: Inserting into an RTRB Tree617944
Ref: catalogue-entry-rtrb-0618288
Ref: 458618294
Node: Steps 1 and 2 in RTRB Insertion619090
Ref: 459619715
Ref: 460620428
Node: Step 3 in RTRB Insertion620961
Ref: 461621231
Ref: 462622276
Ref: 463622818
Ref: 464623566
Ref: 465623739
Ref: 466625118
Ref: 467626115
Ref: 468627531
Ref: 469628479
Node: Deleting from an RTRB Tree628746
Ref: catalogue-entry-rtrb-1629076
Ref: 470629082
Node: Deleting an RTRB Node Step 2 - Delete629862
Ref: 471630330
Ref: 472631127
Ref: 473631470
Ref: 474631846
Ref: 475632472
Node: Deleting an RTRB Node Step 3 - Rebalance633080
Ref: 476633540
Ref: 477634770
Ref: 478635575
Ref: 479637469
Ref: 480638635
Ref: 481640069
Ref: 482641235
Node: Deleting an RTRB Node Step 4 - Finish Up641574
Ref: 483641783
Node: Testing RTRB Trees641942
Ref: 484642095
Ref: 485642616
Ref: 486643916
Ref: 487645061
Node: BSTs with Parent Pointers645711
Ref: 488648344
Ref: 489648750
Ref: BSTs with Parent Pointers-Footnote-1649117
Node: PBST Data Types649245
Ref: 490649640
Node: PBST Operations650901
Ref: 491651619
Node: Inserting into a PBST652203
Ref: catalogue-entry-pbst-0652505
Ref: 492652511
Ref: 493653018
Ref: 494653357
Node: Deleting from a PBST653777
Ref: catalogue-entry-pbst-1654066
Ref: 495654072
Ref: 496654814
Ref: 497655425
Ref: 498655637
Ref: pbstdel1656071
Ref: 499656238
Ref: pbstdel2656545
Ref: 500657097
Ref: pbstdel3657439
Ref: 501657732
Ref: 502658949
Ref: 503659374
Node: Traversing a PBST659767
Ref: 504660147
Node: PBST Traverser First Initialization660976
Ref: catalogue-entry-pbst-2661330
Ref: 505661336
Node: PBST Traverser Last Initialization661836
Ref: catalogue-entry-pbst-3662166
Ref: 506662172
Node: PBST Traverser Find Initialization662670
Ref: catalogue-entry-pbst-4663142
Ref: 507663148
Node: PBST Traverser Insert Initialization663772
Ref: catalogue-entry-pbst-5664113
Ref: 508664119
Node: PBST Traverser Advancing665209
Ref: catalogue-entry-pbst-6666560
Ref: 509666566
Node: PBST Traverser Retreating667494
Ref: catalogue-entry-pbst-7667768
Ref: 510667774
Node: Copying a PBST668704
Ref: catalogue-entry-pbst-8669287
Ref: 511669293
Ref: 512672351
Node: Balancing a PBST672827
Ref: catalogue-entry-pbst-9673328
Ref: 513673334
Ref: catalogue-entry-pbst-10673689
Ref: 514673695
Ref: 515674295
Ref: catalogue-entry-pbst-11675296
Ref: 516675302
Node: Testing PBSTs676253
Ref: 517676386
Ref: 518676892
Ref: 519678400
Ref: 520679134
Node: AVL Trees with Parent Pointers679671
Ref: 521680302
Ref: 522680697
Node: PAVL Data Types681051
Ref: 523681366
Node: PBST Rotations681790
Ref: pbstrot682753
Node: PAVL Operations682918
Ref: 524683258
Node: Inserting into a PAVL Tree683806
Ref: catalogue-entry-pavl-0684496
Ref: 525684502
Node: Steps 1 and 2 in PAVL Insertion685354
Ref: 526686034
Ref: 527686562
Node: Step 3 in PAVL Insertion686760
Ref: 528687747
Node: Rebalancing PAVL Trees688357
Ref: 529689250
Ref: 530689878
Ref: 531690507
Ref: 532691822
Node: PAVL Insertion Symmetric Case692224
Ref: 533692398
Ref: 534692758
Ref: 535693053
Node: Deleting from a PAVL Tree693456
Ref: catalogue-entry-pavl-1694136
Ref: 536694142
Node: Deleting a PAVL Node Step 2 - Delete694871
Ref: 537695494
Ref: 538696108
Ref: 539696398
Ref: 540696737
Node: Deleting a PAVL Node Step 3 - Update696913
Ref: 541697385
Node: Deleting a PAVL Node Step 4 - Rebalance698126
Ref: 542698457
Ref: 543698937
Ref: 544699600
Node: PAVL Deletion Symmetric Case700056
Ref: 545700245
Ref: 546700720
Ref: 547700945
Node: Traversing a PAVL Tree701402
Ref: 548701858
Node: Copying a PAVL Tree702559
Ref: catalogue-entry-pavl-2702855
Ref: 549702861
Node: Testing PAVL Trees705746
Ref: 550705932
Ref: 551706451
Ref: 552708147
Node: Red-Black Trees with Parent Pointers709192
Ref: 553709642
Ref: 554710026
Node: PRB Data Types710302
Ref: 555710667
Node: PRB Operations711179
Ref: 556711614
Node: Inserting into a PRB Tree712206
Ref: catalogue-entry-prb-0712792
Ref: 557712798
Node: Step 2 in PRB Insertion713573
Ref: 558713891
Node: Step 3 in PRB Insertion714040
Ref: 559715519
Ref: 560716428
Ref: 561717949
Ref: 562718959
Ref: 563720307
Node: PRB Insertion Symmetric Case720564
Ref: 564720737
Ref: 565721333
Ref: 566721507
Ref: 567721864
Node: Deleting from a PRB Tree722122
Ref: catalogue-entry-prb-1722577
Ref: 568722583
Node: Deleting a PRB Node Step 2 - Delete723477
Ref: 569724000
Ref: 570724640
Ref: 571725117
Ref: 572725669
Node: Deleting a PRB Node Step 3 - Rebalance725875
Ref: 573726732
Ref: 574727936
Ref: 575729708
Ref: 576730209
Ref: 577730534
Ref: 578731803
Node: Deleting a PRB Node Step 4 - Finish Up732171
Ref: 579732410
Node: PRB Deletion Symmetric Case732585
Ref: 580732771
Ref: 581733521
Ref: 582733874
Ref: 583733999
Ref: 584734399
Node: Testing PRB Trees734771
Ref: 585734953
Ref: 586735461
Ref: 587736672
Node: References738125
Ref: Aho 1986738292
Ref: Bentley 2000738444
Ref: Brown 2001738554
Ref: Cormen 1990738711
Ref: FSF 1999738856
Ref: FSF 2001738956
Ref: ISO 1990739049
Ref: ISO 1998739269
Ref: ISO 1999739396
Ref: Kernighan 1976739526
Ref: Kernighan 1988739651
Ref: Knuth 1997739795
Ref: Knuth 1998a739952
Ref: Knuth 1998b740111
Ref: Knuth 1977740268
Ref: Knuth 1978740431
Ref: Knuth 1992740591
Ref: Knuth 2000740794
Ref: Pfaff 1998741019
Ref: Sedgewick 1998741226
Ref: SGI 1993741349
Ref: Stout 1986741474
Ref: Summit 1999741625
Node: Supplementary Code741792
Node: Option Parser742122
Ref: 588742537
Ref: 589742975
Ref: 590743565
Node: Command-Line Parser747376
Ref: 591747823
Node: GNU Free Documentation License757219
Node: Glossary779659
Ref: adjacent779824
Ref: AVL tree779935
Ref: balance780099
Ref: balance condition780301
Ref: balance factor780431
Ref: balanced tree780653
Ref: binary search780943
Ref: binary search tree781090
Ref: binary tree781442
Ref: black box781658
Ref: black-height781794
Ref: BST782039
Ref: child782105
Ref: children782246
Ref: color782301
Ref: complete binary tree782513
Ref: compression782721
Ref: deep copy782832
Ref: dynamic783082
Ref: empty tree783284
Ref: height783335
Ref: idempotent783501
Ref: inorder predecessor783648
Ref: inorder successor783762
Ref: inorder traversal783874
Ref: iteration784067
Ref: key784261
Ref: leaf784361
Ref: left child784444
Ref: left rotation784643
Ref: left subtree784686
Ref: left-threaded tree784763
Ref: literate programming784993
Ref: node785170
Ref: non-branching node785335
Ref: nonterminal node785458
Ref: parent785562
Ref: parent pointer785735
Ref: pathological case785820
Ref: path786068
Ref: postorder traversal786249
Ref: preorder traversal786444
Ref: rebalance786638
Ref: recursion787137
Ref: red-black tree787316
Ref: right child787564
Ref: right rotation787767
Ref: right subtree787811
Ref: right-threaded tree787889
Ref: rotation788092
Ref: root788429
Ref: rule 1788678
Ref: rule 2788851
Ref: sentinel789167
Ref: sequential search789394
Ref: sequential search with sentinel789553
Ref: shallow copy789705
Ref: simple path789952
Ref: static790042
Ref: subtree790358
Ref: symmetric traversal790465
Ref: tag790541
Ref: tail recursion790698
Ref: terminal node790956
Ref: thread791066
Ref: threaded tree791327
Ref: traversal791537
Ref: undefined behavior791854
Ref: value792083
Ref: vine792237
Ref: visit792367
Node: Answers to All the Exercises792515
Node: Answers for Chapter 2793039
Ref: 2-1#1793201
Ref: 2-2#1793509
Ref: 2-2#2794039
Ref: 2-3#1794410
Ref: 2-3#2795059
Ref: 2-3#3795704
Ref: 2-3#4795931
Ref: 2-3#5796056
Ref: 2-3#6797305
Ref: 2-5#1798886
Ref: 2-5#2799469
Ref: 592799555
Ref: 2-5#3800017
Ref: 2-7#1801670
Ref: 593801912
Ref: 2-8#1802271
Ref: 2-8#2802474
Ref: 2-8#3802723
Ref: 594802734
Ref: 2-9#1803356
Ref: 595803703
Ref: 2-9#2804081
Ref: 596804858
Ref: 2-9#3805397
Ref: 2-12#1805749
Ref: 2-12#2807263
Node: Answers for Chapter 3808023
Ref: 3-1#1808215
Ref: 597808370
Ref: 3-4#1808918
Ref: 3-5#1809028
Ref: 598809361
Ref: 3-5#2810181
Ref: 599810382
Ref: 600811488
Ref: 3-5#3812098
Ref: 601812150
Ref: 602812527
Ref: 603813193
Ref: 604813476
Ref: 605814599
Ref: 606815096
Ref: 607815787
Ref: 608816285
Ref: 609817676
Ref: 610818321
Ref: 611818918
Ref: 612819494
Ref: 613819840
Ref: 614820386
Ref: 615820673
Ref: 616820871
Ref: 617820972
Ref: 3-5#4821600
Ref: 3-6#1825351
Ref: 618825393
Ref: 3-6#2826138
Ref: 619826149
Ref: 620826590
Ref: 621827515
Node: Answers for Chapter 4827834
Ref: 4#1828001
Ref: 4-2-2#1828523
Ref: 4-2-3#1828925
Ref: 4-3#1829711
Ref: 4-3#2830090
Ref: catalogue-entry-bst-34830347
Ref: catalogue-entry-bst-35830563
Ref: 4-7#1830802
Ref: 4-7#2832208
Ref: catalogue-entry-bst-36832593
Ref: 622832599
Ref: 4-7#3833221
Ref: 4-7#4833528
Ref: catalogue-entry-bst-37833825
Ref: 623833831
Ref: 4-7-1#1834765
Ref: catalogue-entry-bst-38834769
Ref: 624834775
Ref: 625835597
Ref: 626836008
Ref: 4-7-1#2836149
Ref: catalogue-entry-bst-39836288
Ref: 627836294
Ref: 628837402
Ref: 629838077
Ref: 4-7-1#3838948
Ref: 4-8#1840708
Ref: catalogue-entry-bst-40840796
Ref: 630840802
Ref: 4-8#2840905
Ref: catalogue-entry-bst-41840976
Ref: 631840982
Ref: 4-8#3841346
Ref: 4-9-1#1841884
Ref: 4-9-1#2842349
Ref: catalogue-entry-bst-42842353
Ref: 632842359
Ref: 4-9-2#1842838
Ref: catalogue-entry-bst-43844561
Ref: 633844567
Ref: 4-9-2-1#1845864
Ref: catalogue-entry-bst-44847298
Ref: 634847304
Ref: 4-9-2-1#2847948
Ref: 4-9-3#1848527
Ref: 4-9-3#2849335
Ref: 4-9-3#3850356
Ref: catalogue-entry-bst-45851623
Ref: 635851629
Ref: 4-9-3-2#1852861
Ref: 4-9-3-6#1853112
Ref: 4-10-1#1853253
Ref: catalogue-entry-bst-46853514
Ref: 636853520
Ref: 637854289
Ref: catalogue-entry-bst-47854543
Ref: 638854549
Ref: 4-10-1#2855261
Ref: catalogue-entry-bst-48855345
Ref: 639855351
Ref: 4-10-2#1856500
Ref: 640856536
Ref: 4-11-1#1858134
Ref: 4-13#1858232
Ref: catalogue-entry-bst-49858689
Ref: 641858695
Ref: 4-14-1#1861201
Ref: 4-14-1#2862023
Ref: 4-14-1-1#1862740
Ref: 4-14-1-1#2863325
Ref: 4-14-2#1863366
Ref: 642863377
Ref: 4-14-2#2863863
Ref: 643864036
Ref: 4-14-2#3864588
Ref: 644864599
Ref: 4-14-2#4866699
Ref: 645867230
Ref: 4-14-3#1867824
Ref: 646867835
Ref: 4-14-4#1870158
Ref: 4-15#1870511
Ref: 647870662
Ref: 648871040
Ref: 649871646
Ref: 650872567
Ref: 651873489
Node: Answers for Chapter 5873913
Ref: 5-4#1874105
Ref: 5-4-2#1875578
Ref: 5-4-3#1876109
Ref: 5-4-3#2876604
Ref: 5-4-3#3877324
Ref: 5-4-3#4877973
Ref: catalogue-entry-avl-10878003
Ref: 652878009
Ref: 5-4-4#1878827
Ref: 5-4-4#2878941
Ref: 5-4-4#3879345
Ref: 5-4-4#4881371
Ref: 5-4-4#5881712
Ref: 5-5-2#1881751
Ref: catalogue-entry-avl-11881817
Ref: 653881823
Ref: 5-5-2#2882115
Ref: 5-5-4#1882327
Ref: 5-5-4#2882568
Ref: 5-6#1885181
Node: Answers for Chapter 6885580
Ref: 6-1#1885772
Ref: 6-1#2885999
Ref: 6-1#3886609
Ref: 6-2#1887095
Ref: 6-4-2#1887485
Ref: 6-4-3#1887640
Ref: 6-4-3#2887884
Ref: 6-5-1#1888003
Ref: 6-5-1#2888505
Ref: catalogue-entry-rb-3888929
Ref: 654888935
Ref: 655889333
Ref: 656889759
Node: Answers for Chapter 7889902
Ref: 7-2#1890094
Ref: 7-6#1890507
Ref: 7-7#1890665
Ref: catalogue-entry-tbst-20890797
Ref: 657890803
Ref: 7-7#2891176
Ref: 7-7#3892421
Ref: catalogue-entry-tbst-21892477
Ref: 658892483
Ref: 7-7#4892985
Ref: 7-9#1894750
Ref: 7-9#2895280
Node: Answers for Chapter 8895771
Ref: 8-1#1895963
Ref: 8-2#1896439
Ref: catalogue-entry-tbst-22896517
Ref: catalogue-entry-tbst-23896896
Ref: 8-4-2#1897302
Ref: catalogue-entry-tavl-5897641
Ref: 659897647
Ref: 8-5-2#1898105
Ref: catalogue-entry-tavl-6898267
Ref: 660898273
Ref: 8-5-6#1898440
Ref: 8-5-6#2900638
Ref: 8-5-6#3901156
Ref: catalogue-entry-tavl-7901344
Ref: 661901350
Ref: 662902176
Ref: 663902842
Ref: 664903118
Ref: 665903372
Ref: 666903805
Ref: 667904619
Ref: 668905193
Ref: 669906079
Node: Answers for Chapter 9907182
Ref: 9-3-3#1907379
Ref: catalogue-entry-trb-2907488
Ref: 670907494
Ref: 9-4-2#1911262
Ref: catalogue-entry-trb-3911266
Ref: 671911272
Ref: 9-4-5#1911825
Ref: catalogue-entry-trb-4912075
Ref: 672912081
Node: Answers for Chapter 10919691
Ref: 10#1919862
Ref: 10-5-1#1920106
Ref: catalogue-entry-rtbst-15920110
Ref: 673920116
Ref: 10-5-2#1920479
Ref: catalogue-entry-rtbst-16920651
Ref: 674920657
Node: Answers for Chapter 11921178
Ref: 11-3#1921377
Ref: catalogue-entry-rtbst-17921381
Ref: catalogue-entry-rtbst-18921738
Ref: 11-5-4#1922114
Ref: 11-5-4#2922375
Ref: catalogue-entry-rtavl-4922379
Ref: 675922385
Ref: 676922995
Ref: 677923282
Ref: 678923498
Ref: 679923907
Ref: 11-5-4#3924650
Ref: catalogue-entry-rtavl-5924654
Ref: 680924660
Node: Answers for Chapter 13925258
Ref: 13-4#1925457
Ref: 13-7#1925602
Ref: catalogue-entry-pbst-12925606
Ref: 681925612
Ref: catalogue-entry-pbst-13925908
Ref: 682925914
Ref: 683926635
Ref: catalogue-entry-pbst-14926806
Ref: 684926812
Node: Answers for Chapter 14927365
Ref: 14-2#1927533
Ref: catalogue-entry-pbst-15927537
Ref: catalogue-entry-pbst-16927886
Ref: 14-4-2#1928264
Ref: 14-4-2#2929046
Node: Catalogue of Algorithms929135
Node: Index946213

End Tag Table
