-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTriNaryTree.java
More file actions
103 lines (93 loc) · 2.71 KB
/
Copy pathTriNaryTree.java
File metadata and controls
103 lines (93 loc) · 2.71 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
package main;
public class TriNaryTree {
Node root = null;
//Reset the root of the tree
public TriNaryTree() {
root = null;
}
//Get the root of the tree
public Node Root() {
return root;
}
//Add integer array
public void insert(int A[]) {
//Add the first integer as root
root = new Node(A[0]);
//Insert values into the tree
for (int i = 1; i < A.length; i++) {
insert(root, A[i]);
}
}
//Add new integer node to the tree
public void insert(Node node, int value) {
//for left node case
if (value < node.data) {
// create left child if not exist
if (null == node.left) {
node.left = new Node(value);
} else {
insert(node.left, value);
}
}
// for right node case
else if (value > node.data) {
// create right child if not exist
if (null == node.right) {
node.right = new Node(value);
} else {
insert(node.right, value);
}
}
// for middle node case
else {
// create middle child if not exist
if (null == node.middle) {
node.middle = new Node(value);
} else {
insert(node.middle, value);
}
}
}
///Find the most left node
private Node findMostLeft(Node node) {
if (node != null) {
while (node.left != null) {
node = node.left;
}
}
return node;
}
public Node delete(int value, Node node) {
if (null == node) {
throw new IllegalArgumentException("Node cannot be set to null.");
} else if (value < node.data) {
node.left = delete(value, node.left);
} else if (value > node.data) {
node.right = delete(value, node.right);
} else {
//delete middle if it exists
if (node.middle != null) {
node.middle = delete(value, node.middle);
} else if (node.right != null) {
//replace it with most left node in Right subtree
Node ml = findMostLeft(node.right);
node.data = ml.data;
node.right = delete(ml.data, node.right);
} else {
//replace it with the left node
node = node.left;
}
}
return node;
}
}
//TriNary Tree Node definition
class Node {
int data;
Node left, middle, right;
public Node(int value) {
//Not sure if it is required, just in case
if (value <= 0) throw new IllegalArgumentException("It must be a positive number.");
data = value;
}
}