-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAugmentedBST.java
More file actions
69 lines (60 loc) · 1.8 KB
/
AugmentedBST.java
File metadata and controls
69 lines (60 loc) · 1.8 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
package BinarySearchTree;
public class AugmentedBST {
AugmentedNode root;
public AugmentedBST() {
}
public void insert(int v) {
AugmentedNode x = new AugmentedNode(v);
if (root == null) {
root = x;
}
else {
AugmentedNode runner = root, pre = null;
while (runner != null) {
if (runner.val == x.val) return;
runner.rank++;
pre = runner;
if (x.val < runner.val) {
runner = runner.left;
}
else {
runner = runner.right;
}
}
if (pre.val > x.val) {
pre.left = x;
}
else {
pre.right = x;
}
x.parent = pre;
}
}
public AugmentedNode selectKthSmallestNode(AugmentedNode root, int k) {
int leftSize = root.left == null ? 0 : root.left.rank;
leftSize++;
if (leftSize == k) return root;
if (k < leftSize) return selectKthSmallestNode(root.left, k);
return selectKthSmallestNode(root.right, k - leftSize);
}
public int getRank(AugmentedNode root, AugmentedNode x) {
int total = root.left == null ? 1 : root.left.rank + 1;
AugmentedNode runner = x;
while (runner != root) {
if (runner == runner.parent.right) {
total += runner.parent.left == null ? 1 : runner.parent.left.rank + 1;
}
runner = runner.parent;
}
return total;
}
}
class AugmentedNode {
int val;
int rank;
AugmentedNode left, right, parent;
AugmentedNode(int x) {
val = x;
rank = 1;
}
}