-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathalgoI_week4_2b.html
More file actions
1060 lines (985 loc) · 55.1 KB
/
algoI_week4_2b.html
File metadata and controls
1060 lines (985 loc) · 55.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<!DOCTYPE html>
<html lang="zh-Hant"
>
<head>
<title>[Algorithms I] Week 4-2b Binary Search Trees - mx's blog</title>
<!-- Using the latest rendering mode for IE -->
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<meta name="theme-color" content="#6b5594">
<meta name="msapplication-navbutton-color" content="#6b5594">
<meta name="apple-mobile-web-app-status-bar-style" content="#6b5594">
<link rel="manifest" href="/manifest.json">
<link rel="canonical" href="https://x-wei.github.io/algoI_week4_2b.html">
<meta name="author" content="mx" />
<meta name="keywords" content="algorithm" />
<meta name="description" content="(BST是锻炼递归代码的好题目) 1. Binary Search Trees def. BST A binary tree where each node has a key: for every node, the key is larger than all nodes in left subtree, smaller than all nodes in right subtree. Fields: key, val, left, right Implementation An inner class of BST nodes: private class ..." />
<meta property="og:site_name" content="mx's blog" />
<meta property="og:type" content="article"/>
<meta property="og:title" content="[Algorithms I] Week 4-2b Binary Search Trees"/>
<meta property="og:url" content="https://x-wei.github.io/algoI_week4_2b.html"/>
<meta property="og:description" content="(BST是锻炼递归代码的好题目) 1. Binary Search Trees def. BST A binary tree where each node has a key: for every node, the key is larger than all nodes in left subtree, smaller than all nodes in right subtree. Fields: key, val, left, right Implementation An inner class of BST nodes: private class ..."/>
<meta property="article:published_time" content="2015-08-26" />
<meta property="article:section" content="notes" />
<meta property="article:tag" content="algorithm" />
<meta property="article:author" content="mx" />
<meta property="og:image"
content="https://x-wei.github.io/algoI_week4_2b.png"/>
<!-- Bootstrap -->
<link href="https://x-wei.github.io/theme/css/bootstrap.min.css" rel="stylesheet">
<link href="https://x-wei.github.io/theme/css/font-awesome.min.css" rel="stylesheet">
<link href="https://x-wei.github.io/theme/css/pygments/manni.css" rel="stylesheet">
<link href="https://x-wei.github.io/theme/tipuesearch/tipuesearch.css" rel="stylesheet">
<link rel="stylesheet" href="https://x-wei.github.io/theme/css/style.css" type="text/css"/>
<link href="https://x-wei.github.io/feeds/atom.xml" type="application/atom+xml" rel="alternate"
title="mx's blog ATOM Feed"/>
<link href="https://x-wei.github.io/theme/css/material.min.css" rel="stylesheet">
<link href="https://x-wei.github.io/theme/css/ripples.css" rel="stylesheet">
</head>
<body>
<div style="display:none" id="title">[Algorithms I] Week 4-2b Binary Search Trees - mx's blog</div>
<div class="navbar navbar-default navbar-fixed-top" role="navigation">
<div class="container">
<div class="navbar-header">
<button type="button" class="navbar-toggle" data-toggle="collapse" data-target=".navbar-ex1-collapse">
<span class="sr-only">切换导航</span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
</button>
<a href="https://x-wei.github.io/" class="navbar-brand">
mx's blog </a>
</div>
<div class="collapse navbar-collapse navbar-ex1-collapse">
<ul class="nav navbar-nav">
<li class="dropdown hidden-md hidden-lg hidden-xl">
<a class="dropdown-toggle" data-toggle="dropdown" href="javascript:void(0)">
<i class="fa fa-user"></i><span class="caret"></span>
</a>
<ul class="dropdown-menu">
</ul>
</li>
<ul class="nav navbar-nav hidden-xs hidden-sm">
</ul>
</ul>
<ul class="nav navbar-nav hidden-md hidden-lg hidden-xl">
<li class="dropdown hidden-md hidden-lg hidden-xl">
<a class="dropdown-toggle" data-toggle="dropdown" href="javascript:void(0)">
<i class="fa fa-folder-o"></i><span class="caret"></span>
</a>
<ul class="dropdown-menu">
<li >
<a href="https://x-wei.github.io/category/misc.html"><i class="fa fa-folder-o"></i> Misc</a>
</li>
<li >
<a href="https://x-wei.github.io/category/music.html"><i class="fa fa-folder-o"></i> Music</a>
</li>
<li class="active">
<a href="https://x-wei.github.io/category/notes.html"><i class="fa fa-folder-o"></i> Notes</a>
</li>
<li >
<a href="https://x-wei.github.io/category/soft.html"><i class="fa fa-folder-o"></i> Soft</a>
</li>
<li >
<a href="https://x-wei.github.io/category/tech.html"><i class="fa fa-folder-o"></i> Tech</a>
</li>
</ul>
</li>
</ul>
<ul class="nav navbar-nav hidden-xs hidden-sm">
<li >
<a href="https://x-wei.github.io/category/misc.html"><i class="fa fa-folder-o"></i> Misc</a>
</li>
<li >
<a href="https://x-wei.github.io/category/music.html"><i class="fa fa-folder-o"></i> Music</a>
</li>
<li class="active">
<a href="https://x-wei.github.io/category/notes.html"><i class="fa fa-folder-o"></i> Notes</a>
</li>
<li >
<a href="https://x-wei.github.io/category/soft.html"><i class="fa fa-folder-o"></i> Soft</a>
</li>
<li >
<a href="https://x-wei.github.io/category/tech.html"><i class="fa fa-folder-o"></i> Tech</a>
</li>
</ul>
<ul class="nav navbar-nav navbar-right hidden-sm hidden-md hidden-lg hidden-xl">
<li class="dropdown hidden-md hidden-lg hidden-xl">
<a class="dropdown-toggle" data-toggle="dropdown" href="javascript:void(0)">
<i class="fa fa-search"></i><span class="caret"></span>
</a>
<ul class="dropdown-menu">
<li><span>
<form class="navbar-search" action="/search.html">
<input type="text" class="search-query form-control col-lg-16" placeholder="Search" name="q" id="tipue_search_input" required>
</form></span>
</li>
</ul>
</li>
</ul>
<ul class="nav navbar-right navbar-form hidden-xs">
<li><span>
<form class="navbar-search" action="/search.html">
<input type="text" class="search-query form-control col-lg-16" placeholder="查找" name="q" id="tipue_search_input" required>
</form></span>
</li>
</ul>
<ul class="nav navbar-nav navbar-right hidden-xs">
<li><a href="https://x-wei.github.io/archives.html"><i class="fa fa-th-list"></i><span class="icon-label">Archive</span></a></li>
</ul>
</div>
<!-- /.navbar-collapse -->
</div>
</div> <!-- /.navbar -->
<!-- Banner -->
<!-- End Banner -->
<div class="container" style="min-height: 100%;height: auto !important;height: 100%;">
<div class="row" style="padding-bottom:80px;padding-top:80px;">
<div class="col-xl-21 col-lg-20 col-md-18">
<div id="loading-block">
<ol class="breadcrumb">
<li><a href="https://x-wei.github.io/" title="mx's blog"><i class="fa fa-home fa-lg"></i></a></li>
<li><a href="https://x-wei.github.io/category/notes.html" title="notes">notes</a></li>
<li class="active">[Algorithms I] Week 4-2b Binary Search Trees</li>
</ol>
<section id="content" class="article-content">
<article>
<header class="page-header jumbotron jumbotron-primary panel-primary" id="article-header">
<div class="panel-heading">
<h1>
[Algorithms I] Week 4-2b Binary Search Trees
<a href="https://x-wei.github.io/algoI_week4_2b.html"
rel="bookmark"
class="btn btn-primary btn-lg"
title="到 [Algorithms I] Week 4-2b Binary Search Trees 的永久链接">
<i class="mdi-action-launch"></i>
</a>
</h1>
</div>
<div class="panel-body">
<div class="post-info">
<span class="published">
<time datetime="2015-08-26T00:00:00+02:00"><i class="fa fa-calendar"></i> Wed, 26 Aug 2015</time>
</span>
<span class="btn-group">
<a href="https://x-wei.github.io/tag/algorithm.html" class="btn btn-primary btn-xs"><i class="fa fa-tag"></i> algorithm</a>
</span>
<span class="label label-default">Series</span>
Part 10 of «Algorithms Princeton MOOC I»
</div><!-- /.post-info --> </div>
</header>
<div class="entry-content jumbotron" id="article-content">
<div class="panel panel-default">
<div class="panel-heading">
目录
</div>
<div class="panel-boy">
<div id="toc"><ul><li><a class="toc-href" href="#1-binary-search-trees" title="1. Binary Search Trees">1. Binary Search Trees</a><ul><li><a class="toc-href" href="#implementation" title="Implementation">Implementation</a></li><li><a class="toc-href" href="#analysis" title="Analysis">Analysis</a></li></ul></li><li><a class="toc-href" href="#2-oredered-operations-in-bst_1" title="2. Oredered Operations in BST">2. Oredered Operations in BST</a><ul><li><a class="toc-href" href="#minmax" title="min/max">min/max</a></li><li><a class="toc-href" href="#floorceiling" title="floor/ceiling">floor/ceiling</a></li><li><a class="toc-href" href="#rankselect" title="rank/select">rank/select</a></li><li><a class="toc-href" href="#iteration" title="iteration">iteration</a></li></ul></li><li><a class="toc-href" href="#3-deletions-in-bst_1" title="3. Deletions in BST">3. Deletions in BST</a><ul><li><a class="toc-href" href="#lazy-approch" title="lazy approch">lazy approch</a></li><li><a class="toc-href" href="#deleteminmax" title="deleteMin/Max">deleteMin/Max</a></li><li><a class="toc-href" href="#hibbard-deletion" title="Hibbard deletion">Hibbard deletion</a></li><li><a class="toc-href" href="#analysis_1" title="Analysis">Analysis</a></li></ul></li></ul></div>
</div>
</div>
<p>(BST是锻炼递归代码的好题目) </p>
<h1 id="1-binary-search-trees">1. Binary Search Trees</h1>
<p>def. <strong>BST</strong> <br/>
A binary tree where each node has a key: <br/>
for every node, the key is larger than <em>all nodes in left</em> subtree, smaller than <em>all nodes in right</em> subtree. <br/>
<img alt="" class="img-responsive" src="../images/algoI_week4_2b/pasted_image.png"/> <br/>
Fields: key, val, left, right </p>
<h2 id="implementation">Implementation</h2>
<p>An inner class of BST nodes: </p>
<div class="highlight"><pre><span class="code-line"><span></span><span class="err">private class Node{ </span></span>
<span class="code-line"><span class="err"> private Key key; </span></span>
<span class="code-line"><span class="err"> private Value val; </span></span>
<span class="code-line"><span class="err"> private Node left, right; </span></span>
<span class="code-line"><span class="err"> public Node(Key k, Value v){...} </span></span>
<span class="code-line"><span class="err">}</span></span>
</pre></div>
<p>skeleton implementation of BST: </p>
<div class="highlight"><pre><span class="code-line"><span></span><span class="err">public class BST<Key implements Comparable<Key>, Value>{ </span></span>
<span class="code-line"><span class="err">private Node root; </span></span>
<span class="code-line"><span class="err">private class Node{...} </span></span>
<span class="code-line"><span class="err">public Value get(Key k){...} </span></span>
<span class="code-line"><span class="err">public void put(Key k, Value v){} </span></span>
<span class="code-line"><span class="err">public void delete(Key k){} </span></span>
<span class="code-line"><span class="err">public Iterable<Key> iterator(){} </span></span>
<span class="code-line"><span class="err">}</span></span>
</pre></div>
<p><strong>search</strong> <br/>
recursive version: <br/>
(或者把这个函数写到Node类里面也可以. ) </p>
<div class="highlight"><pre><span class="code-line"><span></span><span class="err">private Value get(Node nd, Key k){ </span></span>
<span class="code-line"><span class="err"> if(nd==null) return null; // search miss </span></span>
<span class="code-line"><span class="err"> int cmp = k.compareTo(nd.key); </span></span>
<span class="code-line"><span class="err"> if(cmp==0) return nd.val; // search hit </span></span>
<span class="code-line"><span class="err"> else if (cmp>0) return get(nd.right, k); </span></span>
<span class="code-line"><span class="err"> else return get(nd.left, k); </span></span>
<span class="code-line"><span class="err">}</span></span>
</pre></div>
<p>non-recursive version: </p>
<div class="highlight"><pre><span class="code-line"><span></span><span class="err">public Value get(Key k){ </span></span>
<span class="code-line"><span class="err"> Node nd=root; </span></span>
<span class="code-line"><span class="err"> while(root!=null){ </span></span>
<span class="code-line"><span class="err"> int cmp = k.compareTo(nd.key); </span></span>
<span class="code-line"><span class="err"> if (cmp==0) return nd.val; </span></span>
<span class="code-line"><span class="err"> else if(cmp>0) nd = nd.right; </span></span>
<span class="code-line"><span class="err"> else nd = nd.left; </span></span>
<span class="code-line"><span class="err"> } </span></span>
<span class="code-line"><span class="err"> return null; </span></span>
<span class="code-line"><span class="err">}</span></span>
</pre></div>
<p><strong>insert</strong> <br/>
recursive version: <br/>
(注意这个recursive函数的返回值不是void! 这里是一个trick: 返回的是在分叉以前的那个节点) </p>
<div class="highlight"><pre><span class="code-line"><span></span><span class="err">private Node put(Node nd, Key k, Value v){ </span></span>
<span class="code-line"><span class="err"> if(nd==null) return new Node(k, v); </span></span>
<span class="code-line"><span class="err"> int cmp = k.compareTo(nd.key); </span></span>
<span class="code-line"><span class="err"> if(cmp==0) nd.val = v; </span></span>
<span class="code-line"><span class="err"> else if(cmp>0) nd.right = put(nd.right, k, v); </span></span>
<span class="code-line"><span class="err"> else nd.left = put(nd.left, k, v); </span></span>
<span class="code-line"><span class="err"> return nd; </span></span>
<span class="code-line"><span class="err">}</span></span>
</pre></div>
<p>non-recursive version: <br/>
不如递归版本优美... </p>
<div class="highlight"><pre><span class="code-line"><span></span><span class="err">public void put(Key k, Value v){ </span></span>
<span class="code-line"><span class="err"> Node nd = root; </span></span>
<span class="code-line"><span class="err"> while(true){ </span></span>
<span class="code-line"><span class="err"> int cmp = k.compareTo(nd.key); </span></span>
<span class="code-line"><span class="err"> if(cmp==0) { </span></span>
<span class="code-line"><span class="err"> nd.val = v; break; </span></span>
<span class="code-line"><span class="err"> } </span></span>
<span class="code-line"><span class="err"> else if(cmp>0){ </span></span>
<span class="code-line"><span class="err"> if(nd.right!=null) nd = nd.right; </span></span>
<span class="code-line"><span class="err"> else {nd.right = new Node(k,v); break;} </span></span>
<span class="code-line"><span class="err"> } </span></span>
<span class="code-line"><span class="err"> else if (nd.left!=null) { </span></span>
<span class="code-line"><span class="err"> if(nd.left!=null) nd = nd.left; </span></span>
<span class="code-line"><span class="err"> else {nd.left = new Node(k,v); break;} </span></span>
<span class="code-line"><span class="err"> } </span></span>
<span class="code-line"><span class="err"> } </span></span>
<span class="code-line"><span class="err">}</span></span>
</pre></div>
<h2 id="analysis">Analysis</h2>
<p>complexity: depth of the BST. </p>
<p>shape of BST: depends on how the keys come in (order of insertion). <br/>
<img alt="" class="img-responsive" src="../images/algoI_week4_2b/pasted_image001.png"/> <br/>
if keys come in <em>random</em> order: could be pretty well balanced. </p>
<p><strong>BST and quick-sort partitionning</strong> <br/>
<em>The root of BST is just the pivot in quick sort partitioning * <br/>
if all keys are distinct ⇒ one-to-one correspondence between quick sort and BST. <br/>
<img alt="" class="img-responsive" src="../images/algoI_week4_2b/pasted_image002.png"/> <br/>
⇒ <strong>proposition</strong> <br/>
if all keys are distinct and come in randome order, the average number of compares for a search/insert is ~2lnN (or 1.39lgN). <br/>
</em>proof.* <br/>
证明见quicksort那里的数学推导... </p>
<p><strong>proposition </strong>(Reed, 2003) <br/>
N distinct keys come in random order, average tree height = 4.300lnN </p>
<p><strong>Worst-case:</strong> <br/>
The tree becomes just like a linked list: ~N for insertion and search </p>
<h1 id="2-oredered-operations-in-bst_1">2. Oredered Operations in BST</h1>
<p>task: ordered opeartions </p>
<ul>
<li><code>min()/max()</code>: min/max key </li>
<li><code>deleteMin()/deleteMax()</code> </li>
<li><code>floor(Key k)/ceiling(Key k)</code>: largest key <=k / smallest key >=k </li>
<li><code>rank(Key k)</code>: nb of keys < key </li>
<li><code>select(int i)</code>: key with rank=i </li>
<li><code>Iterator<Key> keys(lo, hi)</code>: iterates through [lo, hi] </li>
</ul>
<h2 id="minmax">min/max</h2>
<p>easy <br/>
min: left-most <br/>
max: right-most <br/>
<img alt="" class="img-responsive" src="../images/algoI_week4_2b/pasted_image003.png"/> </p>
<h2 id="floorceiling">floor/ceiling</h2>
<p>a little more complexed... </p>
<p><strong>floor (ceiling is similar)</strong> </p>
<ul>
<li>if k==nd.key </li>
</ul>
<p>return nd.val </p>
<ul>
<li>if k<nd.key </li>
</ul>
<p>the floor <em>must</em> be in the left subtree </p>
<ul>
<li>if k>nd.key <ul>
<li>如果min(nd.right) > k: 返回nd.val </li>
<li>如果min(nd.right) <= k: go to right <div class="highlight"><pre><span class="code-line"><span></span><span class="err">public Value floor(Node nd, Key k){// largest element with key <= k </span></span>
<span class="code-line"><span class="err">int cmp = k.compareTo(nd.key); </span></span>
<span class="code-line"><span class="err">if(cmp==0) return nd.val;//case 1 </span></span>
<span class="code-line"><span class="err">else if(cmp<0) return floor(nd.left, k);//case 2 </span></span>
<span class="code-line"><span class="err">if (nd.right==null || min(nd.right).compareTo(k)>0) //case 3 </span></span>
<span class="code-line"><span class="err"> return nd.val; </span></span>
<span class="code-line"><span class="err">else return floor(nd.right); </span></span>
<span class="code-line"><span class="err">}</span></span>
</pre></div>
</li>
</ul>
</li>
</ul>
<p>他提供的版本和我写的不一样: 递归函数floor返回的也是一个Node: <br/>
<img alt="" class="img-responsive" src="../images/algoI_week4_2b/pasted_image004.png"/> </p>
<h2 id="rankselect">rank/select</h2>
<p>In each node, store the number of nodes in the subtree: <em>add an extra field</em>. </p>
<p><strong>size</strong> </p>
<div class="highlight"><pre><span class="code-line"><span></span><span class="err">private class Node{ </span></span>
<span class="code-line"><span class="err"> private int count; </span></span>
<span class="code-line"><span class="err"> //... </span></span>
<span class="code-line"><span class="err">} </span></span>
<span class="code-line"><span class="err">public int size(){ </span></span>
<span class="code-line"><span class="err"> return size(root); </span></span>
<span class="code-line"><span class="err">} </span></span>
<span class="code-line"><span class="err">public int size(Node nd){ </span></span>
<span class="code-line"><span class="err"> if(nd==null) return 0;// this is why we do not put size() inside the class Node! </span></span>
<span class="code-line"><span class="err"> return nd.count; </span></span>
<span class="code-line"><span class="err">} </span></span>
<span class="code-line"><span class="err">public void put(Node nd, Key k, Value v){ </span></span>
<span class="code-line"><span class="err"> //..... </span></span>
<span class="code-line"><span class="err"> nd.count = size(nd.left)+size(nd.right)+1;//maintain count for each node </span></span>
<span class="code-line"><span class="err"> return nd; </span></span>
<span class="code-line"><span class="err">}</span></span>
</pre></div>
<p><strong>rank</strong> <br/>
(return nb of keys < k) </p>
<ul>
<li>if nd.key==k </li>
</ul>
<p>return size(nd.left) </p>
<ul>
<li>if nd.key>k </li>
</ul>
<p>return rank(nd.left, k) </p>
<ul>
<li>if nd.key<k </li>
</ul>
<p>return size(nd.left)+1+rank(nd,right, k) </p>
<div class="highlight"><pre><span class="code-line"><span></span><span class="err">private int rank(Node nd, Key k){ </span></span>
<span class="code-line"><span class="err"> if(nd==null) return 0;//remember null case </span></span>
<span class="code-line"><span class="err"> int cmp = k.compareTo(nd.key); </span></span>
<span class="code-line"><span class="err"> if(cmp==0) return size(nd.left) </span></span>
<span class="code-line"><span class="err"> else if (cmp<0) return rank(nd.left, k); </span></span>
<span class="code-line"><span class="err"> else return size(nd.left)+1+rank(nd.right,k); </span></span>
<span class="code-line"><span class="err">}</span></span>
</pre></div>
<p>select() similar... </p>
<h2 id="iteration">iteration</h2>
<p><strong>Inorder traversal 中序遍历</strong> </p>
<div class="highlight"><pre><span class="code-line"><span></span><span class="err">public Iterable<Key> keys(){ </span></span>
<span class="code-line"><span class="err"> Queue<Key> q = new Queue<Key>(); </span></span>
<span class="code-line"><span class="err"> inorder(root, q); </span></span>
<span class="code-line"><span class="err"> return q; </span></span>
<span class="code-line"><span class="err">} </span></span>
<span class="code-line"><span class="err">private void inorder(Node nd, Queue<Key> q){ </span></span>
<span class="code-line"><span class="err"> if(nd==null) return; </span></span>
<span class="code-line"><span class="err"> inorder(nd.left); </span></span>
<span class="code-line"><span class="err"> q.enqueue(nd.key); </span></span>
<span class="code-line"><span class="err"> inorder(nd.right); </span></span>
<span class="code-line"><span class="err">}</span></span>
</pre></div>
<p><img alt="" class="img-responsive" src="../images/algoI_week4_2b/pasted_image005.png"/> </p>
<p><strong>property</strong> <br/>
inorder-traversal gives the keys <em>in ascending order</em>. <br/>
(proof by induction) </p>
<h1 id="3-deletions-in-bst_1">3. Deletions in BST</h1>
<p>one final function to implement: delete(Key k), deleteMin(), deleteMax() <br/>
→ and remember to update the count field... </p>
<p>(感觉这篇文章其实就讲的很清楚了: <a href="http://www.algolist.net/Data_structures/Binary_search_tree/Removal">http://www.algolist.net/Data_structures/Binary_search_tree/Removal</a> 这个在递归函数里使用了parent这个参数) </p>
<h2 id="lazy-approch">lazy approch</h2>
<p><code>put(k, null)</code>, and leave the key in the tree (tombstone) <br/>
→ not good if have large number of tombstons... </p>
<h2 id="deleteminmax">deleteMin/Max</h2>
<p>go the the left-most node → replace it with its right node. <br/>
Recusive function with the <em>returning-node trick</em>: </p>
<div class="highlight"><pre><span class="code-line"><span></span><span class="err">private Node deleteMin(Node nd){ </span></span>
<span class="code-line"><span class="err"> if(nd==null) return null; // this might not happen </span></span>
<span class="code-line"><span class="err"> if(nd.left==null) return nd.right; </span></span>
<span class="code-line"><span class="err"> else nd.left = deleteMin(nd.left); </span></span>
<span class="code-line"><span class="err"> nd.count = size(nd.left)+1+size(right);//remember to maintain the count field </span></span>
<span class="code-line"><span class="err"> return nd; </span></span>
<span class="code-line"><span class="err">}</span></span>
</pre></div>
<p>这个递归的技巧又一次使用了. </p>
<h2 id="hibbard-deletion">Hibbard deletion</h2>
<p>first find node with the key to delete, 3 cases: </p>
<ul>
<li>0 children: </li>
</ul>
<p>simply set parent link to null <br/>
<img alt="" class="img-responsive" src="../images/algoI_week4_2b/pasted_image006.png"/> </p>
<ul>
<li>1 child: </li>
</ul>
<p>replace parent link with the child <br/>
<img alt="" class="img-responsive" src="../images/algoI_week4_2b/pasted_image007.png"/> </p>
<ul>
<li><strong>2 children (most subtle)</strong> <ul>
<li>first replace node key with smallest key in right subtree </li>
<li>remove the smallest key in right subtree </li>
</ul>
</li>
</ul>
<p><img alt="" class="img-responsive" src="../images/algoI_week4_2b/pasted_image008.png"/> </p>
<p><strong>code of Hibbard deletion</strong> <br/>
Again (for the 3rd time) use the <em>return-nd trick</em>... </p>
<div class="highlight"><pre><span class="code-line"><span></span><span class="err">private Node delete(Node nd, Key k){ </span></span>
<span class="code-line"><span class="err"> if(nd==null) return null;// search miss </span></span>
<span class="code-line"><span class="err"> int cmp = k.compareTo(nd.key); </span></span>
<span class="code-line"><span class="err"> if(cmp>0) nd.right = delete(nd.right, k); </span></span>
<span class="code-line"><span class="err"> else if(cmp<0) nd.left = delete(nd.left,k); </span></span>
<span class="code-line"><span class="err"> else{ </span></span>
<span class="code-line"><span class="err"> //if nd is the node to delete </span></span>
<span class="code-line"><span class="err"> if(nd.left==null) return nd.right; </span></span>
<span class="code-line"><span class="err"> if(nd.right==null) return nd.left; </span></span>
<span class="code-line"><span class="err"> Key k2 = min(nd.right); </span></span>
<span class="code-line"><span class="err"> nd.key = k2; </span></span>
<span class="code-line"><span class="err"> nd.right = delete(nd.right, k2); </span></span>
<span class="code-line"><span class="err"> } </span></span>
<span class="code-line"><span class="err"> nd.count = size(nd.left)+1+size(nd.right); </span></span>
<span class="code-line"><span class="err"> return nd; </span></span>
<span class="code-line"><span class="err">} </span></span>
<span class="code-line"><span class="err">public void delete(Key k){ </span></span>
<span class="code-line"><span class="err"> root = delete(root, k); </span></span>
<span class="code-line"><span class="err">}</span></span>
</pre></div>
<p>感觉用了recursive return-nd 这个trick的实现很漂亮.... 比那篇博客里放一个参数进递归函数以及用auxroot的办法要好不少... </p>
<h2 id="analysis_1">Analysis</h2>
<p>problem: <em>not symmetric</em> <br/>
If random insert and delete for a while ⇒ tree become much less balanced ! Tree height tend to be sqrt(N). </p>
<p><strong>summery</strong> <br/>
BST is much better in average case, but not guaranteed for worst case. <br/>
<img alt="" class="img-responsive" src="../images/algoI_week4_2b/pasted_image009.png"/> </p>
</div>
<div class="entry-content jumbotron" id="source-content" style="display: none">
<!-- <pre><code id="source-code">
</code></pre> -->
<div id="source-code"></div>
</div>
<!-- /.entry-content -->
<div class="row" id="prevnext">
<div class="col-xs-12">
<a href="https://x-wei.github.io/algoI_week4_2a.html" class="btn btn-default btn-lg" style="float:left;clear:both;background-color:#fff;">
<h4><i class="fa fa-arrow-left"></i>
[Algorithms I] Week 4-2a Elementry Symbol Tables
</h4>
</a>
</div>
<div class="col-xs-12">
<a href="https://x-wei.github.io/algoI_week5_1.html" class="btn btn-default btn-lg" style="float:right;clear:both;background-color:#fff;">
<h4>
[Algorithms I] Week 5-1 Balanced Search Trees<i class="fa fa-arrow-right"></i>
</h4>
</a>
</div>
</div>
<div class="panel panel-default" id="series">
<div class="panel-heading">
<h4>
Part 10 of series «Algorithms Princeton MOOC I»：
</h4>
</div>
<ul class="list-group">
<li class="list-group-item"><a class="btn btn-default" href='https://x-wei.github.io/algoI_week1_1.html' style="text-align:left">[Algorithms I] Week 1-1 Union-Find</a></li>
<li class="list-group-item"><a class="btn btn-default" href='https://x-wei.github.io/algoI_week1_2.html' style="text-align:left">[Algorithms I] Week 1-2 Analysis of Algorithms</a></li>
<li class="list-group-item"><a class="btn btn-default" href='https://x-wei.github.io/algoI_week1_lab.html' style="text-align:left">[Algorithms I] Week1-Lab: Percolation</a></li>
<li class="list-group-item"><a class="btn btn-default" href='https://x-wei.github.io/algoI_week2_1.html' style="text-align:left">[Algorithms I] Week 2-1 Stacks and Queues</a></li>
<li class="list-group-item"><a class="btn btn-default" href='https://x-wei.github.io/algoI_week2_2.html' style="text-align:left">[Algorithms I] Week 2-2 Elementary Sorts</a></li>
<li class="list-group-item"><a class="btn btn-default" href='https://x-wei.github.io/algoI_week3_1.html' style="text-align:left">[Algorithms I] Week 3-1 Mergesort</a></li>
<li class="list-group-item"><a class="btn btn-default" href='https://x-wei.github.io/algoI_week3_2.html' style="text-align:left">[Algorithms I] Week 3-2 Quicksort</a></li>
<li class="list-group-item"><a class="btn btn-default" href='https://x-wei.github.io/algoI_week4_1.html' style="text-align:left">[Algorithms I] Week 4-1 Priority Queue</a></li>
<li class="list-group-item"><a class="btn btn-default" href='https://x-wei.github.io/algoI_week4_2a.html' style="text-align:left">[Algorithms I] Week 4-2a Elementry Symbol Tables</a></li>
<li class="list-group-item"><a class="btn btn-primary" href='https://x-wei.github.io/algoI_week4_2b.html' style="text-align:left">[Algorithms I] Week 4-2b Binary Search Trees</a></li>
<li class="list-group-item"><a class="btn btn-default" href='https://x-wei.github.io/algoI_week5_1.html' style="text-align:left">[Algorithms I] Week 5-1 Balanced Search Trees</a></li>
<li class="list-group-item"><a class="btn btn-default" href='https://x-wei.github.io/algoI_week5_2.html' style="text-align:left">[Algorithms I] Week 5-2 Geometric Applications of BSTs</a></li>
<li class="list-group-item"><a class="btn btn-default" href='https://x-wei.github.io/algoI_week6.html' style="text-align:left">[Algorithms I] Week 6 Hash Tables</a></li>
</ul>
</div>
<section class="comments" id="comments">
<div class="panel-group" id="accordion" role="tablist" aria-multiselectable="true">
<div class="panel panel-primary">
<div class="panel-heading" role="tab" id="disqus-heading">
<h4 class="panel-title">
<a data-toggle="collapse" data-parent="#accordion" href="#disqus-comments" aria-expanded="true" aria-controls="disqus-comments">
<i class="fa fa-comments-o"></i> Disqus 留言
</a>
</h4>
</div>
<div id="disqus-comments" class="panel-collapse collapse.show" role="tabpanel" aria-labelledby="disqus-heading">
<div class="panel-body">
<div class="tab-pane fade active in" id="disqus-comments">
<div id="disqus_thread"></div>
<script type="text/javascript">
/* * * CONFIGURATION VARIABLES: EDIT BEFORE PASTING INTO YOUR WEBPAGE * * */
var disqus_shortname = 'xweisblog'; // required: replace example with your forum shortname
var disqus_identifier = 'algoI_week4_2b';
var disqus_url = 'https://x-wei.github.io/algoI_week4_2b.html';
var disqus_config = function () {
this.language = "zh";
};
/* * * DON'T EDIT BELOW THIS LINE * * */
(function () {
var dsq = document.createElement('script');
dsq.type = 'text/javascript';
dsq.async = true;
dsq.src = '//' + disqus_shortname + '.disqus.com/embed.js';
(document.getElementsByTagName('head')[0] || document.getElementsByTagName('body')[0]).appendChild(dsq);
})();
</script>
<noscript>Please enable JavaScript to view the <a href="http://disqus.com/?ref_noscript">comments powered by
Disqus.</a></noscript>
<a href="http://disqus.com" class="dsq-brlink">comments powered by <span class="logo-disqus">Disqus</span></a>
</div>
</div>
</div>
</div>
</div>
</section> </article>
</section>
</div>
<!-- Modal -->
<div class="modal fade" id="myModal" tabindex="-1" role="dialog" aria-labelledby="myModalLabel" aria-hidden="true">
<div class="modal-dialog modal-lg">
<div class="modal-content">
<a data-dismiss="modal" href="javascript:void(0);">
<img id="mimg" src="" style="width:100%;height:auto">
</a>
</div>
</div><!-- /.modal-dialog -->
</div><!-- /.modal -->
</div>
<div class="col-xl-3 col-lg-4 col-md-6" id="sidebar">
<aside>
<section>
<div class="sidebar-container">
<div class="sidebar-item ">
<div class="panel panel-default">
<div class="panel-heading">
<h4>
<i class="fa fa-user fa-lg"></i>
<a href="https://x-wei.github.io/about.html">
关于 mx
</a>
</h4>
</div>
<div class="panel-body" id="aboutme">
<a href="https://x-wei.github.io/about.html"><img width="100%" src="https://x-wei.github.io/../images/mx.jpg"/></a>
<h3 style="text-align:center">
<a href="https://github.com/x-wei" target="_blank">
<i class="fa fa-github" style="text-align:center"></i></a>
<a href="https://weibo.com/u/1817154611" target="_blank">
<i class="fa fa-weibo" style="text-align:center"></i></a>
<a href="mailto:xwei.mx@gmail.com" target="_blank">
<i class="mdi-communication-email" style="text-align:center"></i></a>
</h3>
<h4 class="widget-title">推荐文章</h4>
<div class="textwidget">
<li class="widget-container widget_text">
<a href="https://x-wei.github.io/TeXmacs_intro.html">学术文章写作利器: TeXmacs介绍</a><br></li>
<li class="widget-container widget_text">
<a href="https://x-wei.github.io/hashcode2014-solved-by-LP.html">运筹的力量: 用线性规划解决Google 2014 HashCode问题</a><br></li>
<li class="widget-container widget_text">
<a href="https://x-wei.github.io/%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%85%A5%E9%97%A8%E7%AE%80%E4%BB%8B.html">正则表达式入门简介</a><br></li>
<li class="widget-container widget_text">
<a href="https://x-wei.github.io/%E6%88%91%E7%9A%84ubuntu10.04%E9%85%8D%E7%BD%AE%E6%80%BB%E7%BB%93.html">我的ubuntu10.04配置总结</a><br></li>
<li class="widget-container widget_text">
<a href="https://x-wei.github.io/PT-summery.html">2011巴黎高科(ParisTech)申请总结</a><br></li>
<li class="widget-container widget_text">
<a href="https://x-wei.github.io/GT-summery.html">用尽量少的时间考一个够用的分数--一点Tofel/GRE备考经验</a><br></li>
<li class="widget-container widget_text">
<a href="https://x-wei.github.io/pelican_github_blog.html">用pelican在github上创建自己的博客!</a><br></li>
</div>
<br><a href="https://www.polytechnique.edu/" target="_blank">
<img src="https://x-wei.github.io/images/x-logo.png" alt="X" width="180" border="0" />
</a><br/>
<br><a href="https://www.sjtu.edu.cn/">
<img src="https://x-wei.github.io/images/ssss.jpg" width="180" border="0" alt="上海西南某高校">
</a><br/>
<br>
<h4 class="widget-title">Visitors</h4>
<script type="text/javascript" src="//rf.revolvermaps.com/0/0/1.js?i=59olkba9w7e&s=220&m=3&v=true&r=false&b=000000&n=false&c=ff0000" async="async"></script>
<!-- hitwebcounter Code START -->
<a href="https://www.hitwebcounter.com/how-to/how-to-what-is-free-blog-counter.php" target="_blank">
<img src="https://hitwebcounter.com/counter/counter.php?page=5954927&style=0036&nbdigits=5&type=ip&initCount=0" title="web counter" Alt="web counter" border="0" ></a>
<br/>
</div>
</div>
</div>
<div class="sidebar-item ">
<div class="panel panel-default">
<div class="panel-heading">
<h4>
<a href="https://x-wei.github.io/tags.html"><i class="fa fa-tags fa-lg"></i><span class="icon-label">标签云</span></a>
</h4>
</div>
<div class="panel-body">
<ul class="list-group list-inline tagcloud" id="tags">
<li class="list-group-item tag-2">
<a href="https://x-wei.github.io/tag/pelican.html">
pelican <sup> 6</sup>
</a>
</li>
<li class="list-group-item tag-2">
<a href="https://x-wei.github.io/tag/google.html">
google <sup> 6</sup>
</a>
</li>
<li class="list-group-item tag-2">
<a href="https://x-wei.github.io/tag/torch.html">
torch <sup> 6</sup>
</a>
</li>
<li class="list-group-item tag-2">
<a href="https://x-wei.github.io/tag/tex.html">
tex <sup> 4</sup>
</a>
</li>
<li class="list-group-item tag-4">
<a href="https://x-wei.github.io/tag/ba-li-gao-ke.html">
巴黎高科 <sup> 1</sup>
</a>
</li>
<li class="list-group-item tag-3">
<a href="https://x-wei.github.io/tag/markdown.html">
markdown <sup> 2</sup>
</a>
</li>
<li class="list-group-item tag-3">
<a href="https://x-wei.github.io/tag/linux.html">
linux <sup> 3</sup>
</a>
</li>
<li class="list-group-item tag-4">
<a href="https://x-wei.github.io/tag/inf422.html">
inf422 <sup> 1</sup>
</a>
</li>
<li class="list-group-item tag-4">
<a href="https://x-wei.github.io/tag/toefl.html">
Toefl <sup> 1</sup>
</a>
</li>
<li class="list-group-item tag-4">
<a href="https://x-wei.github.io/tag/regex.html">
regex <sup> 1</sup>
</a>
</li>
<li class="list-group-item tag-2">
<a href="https://x-wei.github.io/tag/git.html">
git <sup> 5</sup>
</a>
</li>
<li class="list-group-item tag-4">
<a href="https://x-wei.github.io/tag/weka.html">
weka <sup> 1</sup>
</a>
</li>
<li class="list-group-item tag-1">
<a href="https://x-wei.github.io/tag/scala.html">
scala <sup> 12</sup>
</a>
</li>
<li class="list-group-item tag-4">
<a href="https://x-wei.github.io/tag/opencv.html">
opencv <sup> 1</sup>
</a>
</li>
<li class="list-group-item tag-4">
<a href="https://x-wei.github.io/tag/scrapy.html">
scrapy <sup> 1</sup>
</a>
</li>
<li class="list-group-item tag-4">
<a href="https://x-wei.github.io/tag/gre.html">
GRE <sup> 1</sup>
</a>
</li>
<li class="list-group-item tag-4">
<a href="https://x-wei.github.io/tag/lp.html">
LP <sup> 1</sup>
</a>
</li>
<li class="list-group-item tag-2">
<a href="https://x-wei.github.io/tag/android.html">
android <sup> 9</sup>
</a>
</li>
<li class="list-group-item tag-4">
<a href="https://x-wei.github.io/tag/pandas.html">
pandas <sup> 1</sup>
</a>
</li>
<li class="list-group-item tag-3">
<a href="https://x-wei.github.io/tag/codejam.html">
codejam <sup> 2</sup>
</a>
</li>
<li class="list-group-item tag-3">
<a href="https://x-wei.github.io/tag/fr.html">
fr <sup> 2</sup>
</a>
</li>
<li class="list-group-item tag-2">
<a href="https://x-wei.github.io/tag/shell.html">
shell <sup> 4</sup>
</a>
</li>
<li class="list-group-item tag-1">
<a href="https://x-wei.github.io/tag/python.html">
python <sup> 13</sup>
</a>
</li>
<li class="list-group-item tag-4">
<a href="https://x-wei.github.io/tag/simongarfunkel.html">
Simon&Garfunkel <sup> 1</sup>
</a>
</li>
<li class="list-group-item tag-3">
<a href="https://x-wei.github.io/tag/french.html">
french <sup> 2</sup>
</a>
</li>
<li class="list-group-item tag-2">
<a href="https://x-wei.github.io/tag/wai-guan.html">
外观 <sup> 4</sup>
</a>
</li>
<li class="list-group-item tag-3">
<a href="https://x-wei.github.io/tag/zhong-wen-luan-ma.html">
中文乱码 <sup> 2</sup>
</a>
</li>
<li class="list-group-item tag-3">
<a href="https://x-wei.github.io/tag/host.html">
host <sup> 3</sup>
</a>
</li>
<li class="list-group-item tag-3">
<a href="https://x-wei.github.io/tag/ssh.html">
ssh <sup> 2</sup>
</a>
</li>
<li class="list-group-item tag-4">
<a href="https://x-wei.github.io/tag/ubuntu.html">
ubuntu <sup> 1</sup>
</a>
</li>
<li class="list-group-item tag-2">
<a href="https://x-wei.github.io/tag/java.html">
java <sup> 4</sup>
</a>
</li>
<li class="list-group-item tag-2">
<a href="https://x-wei.github.io/tag/spark.html">
spark <sup> 6</sup>
</a>
</li>
<li class="list-group-item tag-3">
<a href="https://x-wei.github.io/tag/tips.html">
tips <sup> 3</sup>
</a>
</li>
<li class="list-group-item tag-1">
<a href="https://x-wei.github.io/tag/deep-learning.html">
deep learning <sup> 28</sup>
</a>
</li>
<li class="list-group-item tag-4">
<a href="https://x-wei.github.io/tag/c.html">
C++ <sup> 1</sup>
</a>
</li>
<li class="list-group-item tag-1">
<a href="https://x-wei.github.io/tag/algorithm.html">
algorithm <sup> 35</sup>
</a>
</li>
<li class="list-group-item tag-4">
<a href="https://x-wei.github.io/tag/texmacs.html">
TeXmacs <sup> 1</sup>
</a>
</li>
<li class="list-group-item tag-2">
<a href="https://x-wei.github.io/tag/ml.html">
ml <sup> 4</sup>
</a>
</li>
<li class="list-group-item tag-2">
<a href="https://x-wei.github.io/tag/eclipse.html">
eclipse <sup> 4</sup>
</a>
</li>
<li class="list-group-item tag-2">
<a href="https://x-wei.github.io/tag/ocaml.html">
OCaml <sup> 8</sup>
</a>
</li>
<li class="list-group-item tag-2">
<a href="https://x-wei.github.io/tag/r.html">
R <sup> 4</sup>
</a>
</li>
<li class="list-group-item tag-3">
<a href="https://x-wei.github.io/tag/chu-guo.html">
出国 <sup> 2</sup>
</a>
</li>
<li class="list-group-item tag-3">
<a href="https://x-wei.github.io/tag/kuai-jie-jian.html">
快捷键 <sup> 3</sup>
</a>
</li>
</ul>
</div>
</div>
</div>
<li class="list-group-item"><h4><i class="fa fa-tags fa-list-ul"></i><span class="icon-label">Series</span></h4>
<ul class="list-group">
<li class="list-group-item">
<h5></i> Previous article</h5>
<a href="https://x-wei.github.io/algoI_week4_2a.html">[Algorithms I] Week 4-2a Elementry Symbol Tables</a>
</li>
<li class="list-group-item">
<h5>Next article</h5>
<a href="https://x-wei.github.io/algoI_week5_1.html">[Algorithms I] Week 5-1 Balanced Search Trees</a>
</li>
</ul>
</li>
<div class="sidebar-item hidden-xs">
<div class="panel panel-default">
<div class="panel-heading">
<h4>
<i class="fa fa-github fa-lg"></i><span class="icon-label">GitHub仓库</span>
</h4>
</div>
<div class="panel-body">
<div id="gh_repos">
<p class="list-group-item">Status updating...</p>
</div>
<a href="https://github.com/x-wei">@x-wei</a> on GitHub
</div>
</div>
</div>
</div>
</section>
<div class="panel panel-default hidden-xs hidden-sm" id="affix-toc">
<div class="panel-heading"><h4>
目录</h4>
</div>
<div class="panel-boy">
<div id="toc"><ul><li><a class="toc-href" href="#1-binary-search-trees" title="1. Binary Search Trees">1. Binary Search Trees</a><ul><li><a class="toc-href" href="#implementation" title="Implementation">Implementation</a></li><li><a class="toc-href" href="#analysis" title="Analysis">Analysis</a></li></ul></li><li><a class="toc-href" href="#2-oredered-operations-in-bst_1" title="2. Oredered Operations in BST">2. Oredered Operations in BST</a><ul><li><a class="toc-href" href="#minmax" title="min/max">min/max</a></li><li><a class="toc-href" href="#floorceiling" title="floor/ceiling">floor/ceiling</a></li><li><a class="toc-href" href="#rankselect" title="rank/select">rank/select</a></li><li><a class="toc-href" href="#iteration" title="iteration">iteration</a></li></ul></li><li><a class="toc-href" href="#3-deletions-in-bst_1" title="3. Deletions in BST">3. Deletions in BST</a><ul><li><a class="toc-href" href="#lazy-approch" title="lazy approch">lazy approch</a></li><li><a class="toc-href" href="#deleteminmax" title="deleteMin/Max">deleteMin/Max</a></li><li><a class="toc-href" href="#hibbard-deletion" title="Hibbard deletion">Hibbard deletion</a></li><li><a class="toc-href" href="#analysis_1" title="Analysis">Analysis</a></li></ul></li></ul></div>
</div>
</div>
</aside>
</div>
</div>
</div>
<footer id="fcfooter">
<hr/>
<div class="container">
links :
<a href="https://farseerfc.github.com/">farseerfc</a>
<a href="https://hyhx2008.github.com/">H.Y.</a>
<a href="https://reginald1787.github.io/">reginald1787</a>
<a href="https://log.dofine.me/">dofine</a>
<div class="row">
<div class="col-md-14">
<p><small>
© 2020 mx
· 通过
<a href="https://docs.getpelican.com/" target="_blank">Pelican</a> 生成 <a rel="license" href="https://creativecommons.org/licenses/by-nc-sa/4.0/"><img alt="Creative Commons License" style="border-width:0" src="//i.creativecommons.org/l/by-nc-sa/4.0/80x15.png" /></a>
<!-- Content -->
<!-- licensed under a <a rel="license" href="https://creativecommons.org/licenses/by-nc-sa/4.0/">Creative Commons Attribution 4.0 International License</a>, except where indicated otherwise. -->
</small></p>
</div>
</div>
</div>
<a href="#" class="btn btn-primary btn-fab btn-raised mdi-editor-vertical-align-top withripple" style="position:fixed;bottom:30px;right:30px;z-index:1000"></a>
</footer>
<script src="https://x-wei.github.io/theme/js/jquery.min.js"></script>
<!-- Include all compiled plugins (below), or include individual files as needed -->
<script src="https://x-wei.github.io/theme/js/bootstrap.min.js"></script>
<!-- Enable responsive features in IE8 with Respond.js (https://github.com/scottjehl/Respond) -->
<script src="https://x-wei.github.io/theme/js/respond.min.js"></script>
<!-- GitHub JS -->
<script type="text/javascript">
$(document).ready(function () {
if (!window.jXHR) {
var jxhr = document.createElement('script');
jxhr.type = 'text/javascript';
jxhr.src = 'https://x-wei.github.io/theme/js/jXHR.js';
var s = document.getElementsByTagName('script')[0];
s.parentNode.insertBefore(jxhr, s);
}
github.showRepos({
user: 'x-wei',
count: 5,
skip_forks: false,
target: '#gh_repos'
});
});
</script>
<script src="https://x-wei.github.io/theme/js/github.js" type="text/javascript"></script>
<!-- End GitHub JS Code -->
<!-- Disqus -->
<script type="text/javascript">
/* * * CONFIGURATION VARIABLES: EDIT BEFORE PASTING INTO YOUR WEBPAGE * * */
var disqus_shortname = 'xweisblog'; // required: replace example with your forum shortname
/* * * DON'T EDIT BELOW THIS LINE * * */
(function () {
var s = document.createElement('script');