forked from iRupam/NewtonSchoolInfinityJune21
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathInsertionAndTraversal.java
More file actions
143 lines (120 loc) · 3.44 KB
/
InsertionAndTraversal.java
File metadata and controls
143 lines (120 loc) · 3.44 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
package InfinityJune21.BinaryTrees;
import java.util.LinkedList;
import java.util.Queue;
public class InsertionAndTraversal {
static Node root;
static class Node {
int key;
Node left, right;
Node(int key) {
this.key = key;
left = right = null;
}
}
static void insert(int key) {
Node node = new Node(key);
if(root == null) {
root = node;
}
else {
Node temp = root;
Queue<Node> queue = new LinkedList<Node>();
queue.add(temp);
while(!queue.isEmpty()) {
temp = queue.poll();
if(temp.left == null) {
temp.left = node;
break;
}
else {
queue.add(temp.left);
}
if(temp.right == null) {
temp.right = node;
break;
}
else {
queue.add(temp.right);
}
}
}
}
static void inorderTraversal(Node temp) {
if(root == null) {
System.out.println("Tree is empty");
}
else if(temp == null) {
}
else {
inorderTraversal(temp.left);
System.out.print(temp.key + " ");
inorderTraversal(temp.right);
}
}
static void preorderTraversal(Node temp) {
if(root == null) {
System.out.println("Tree is empty");
}
else if(temp == null) {
}
else {
System.out.print(temp.key + " ");
preorderTraversal(temp.left);
preorderTraversal(temp.right);
}
}
static void postorderTraversal(Node temp) {
if(root == null) {
System.out.println("Tree is empty");
}
else if(temp == null) {
}
else {
postorderTraversal(temp.left);
postorderTraversal(temp.right);
System.out.print(temp.key + " ");
}
}
static void levelOrderTraversal() {
if(root == null) {
System.out.println("Tree is empty");
}
else {
Node temp = root;
Queue<Node> queue = new LinkedList<Node>();
queue.add(temp);
while(!queue.isEmpty()) {
temp = queue.poll();
System.out.print(temp.key + " ");
if(temp.left != null) {
queue.add(temp.left);
}
if(temp.right != null) {
queue.add(temp.right);
}
}
}
}
public static void main(String[] args) {
//First node
insert(10);
insert(20);
insert(30);
insert(40);
insert(50);
insert(60);
insert(70);
System.out.println("Level Order: ");
levelOrderTraversal();
System.out.println();
System.out.println("Preorder: ");
preorderTraversal(root);
System.out.println();
System.out.println("Inorder: ");
inorderTraversal(root);
System.out.println();
System.out.println("Postorder: ");
postorderTraversal(root);
System.out.println();
}
}