leetcode/BinarySearchTree.java at master · actor168/leetcode · GitHub

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
classBinarySearchTree {

Noderoot;
intheight;

voidtraverseFrom(Nodenode) {
if (node == null) {
return;
 }
traverseFrom(node.left);
System.out.print(node.value + ",");
traverseFrom(node.right);
 }

voidtraverse() {
traverseFrom(root);
 }

Nodesearch(intvalue) {
Noden = root;
while (n != null && n.value != value) {
if (n.value < value) {
n = n.right;
 }else {
n = n.right;
 }
 }
returnn;
 }

Nodeminimum(Noden) {
while (n.left != null) {
n = n.left;
 }
returnn;
 }

Nodemaximum(Noden) {
while (n.right != null) {
n = n.right;
 }
returnn;
 }

Nodesuccessor(Noden) {
if (n.right != null) {
returnminimum(n.right);
 }

Nodex = n.parent;
while (x != null && x.right == n) {
n = x;
x = n.parent;
 }

returnx;
 }

Nodepredecessor(Noden) {
if (n.left != null) {
returnmaximum(n.left);
 }

Nodex = n.parent;
while (x != null && x.left == n) {
n = x;
x = n.parent;
 }
returnx;
 }

Nodeinsert(Noden) {
returnnull;
 }

Nodedelete(Noden) {
returnnull;
 }

publicstaticvoidmain(String[] args) {

 }
}

classNode{
intvalue;
Nodeleft;
Noderight;
Nodeparent;

Node(intv){
this.value = v;
 }
}