-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day_49_TreeImplementation.java
74 lines (65 loc) · 2.04 KB
/
Day_49_TreeImplementation.java
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
package com.TrX;
public class Day_49_TreeImplementation {
//InOrder Traversal
public void inOrderTraversal(TreeNode Root){
if(Root == null){
return;
}
inOrderTraversal(Root.Left);
System.out.println(Root.data);
inOrderTraversal(Root.Right);
}
//PreOrder Traversal
public void preOrderTraversal(TreeNode Root){
if(Root == null){
return;
}
System.out.println(Root.data);
preOrderTraversal(Root.Left);
preOrderTraversal(Root.Right);
}
//PostOrder Traversal
public void postOrderTraversal(TreeNode Root){
if(Root == null){
return;
}
postOrderTraversal(Root.Left);
postOrderTraversal(Root.Right);
System.out.println(Root.data);
}
//Create a new Node
public TreeNode CreateNode(int nodeValue){
TreeNode node = new TreeNode();
node.data = nodeValue;
node.Left = null;
node.Right = null;
return node;
}
//Insert on left
public TreeNode leftInsert(TreeNode Root,int nodeValue){
Root.Left = CreateNode(nodeValue);
return Root.Left;
}
//Insert on Right
public TreeNode RightInsert(TreeNode Root,int nodeValue){
Root.Right = CreateNode(nodeValue);
return Root.Right;
}
public static class TreeTest {
public static void main(String[] args) {
Day_49_TreeImplementation T1 = new Day_49_TreeImplementation();
TreeNode node = T1.CreateNode(10);
T1.leftInsert(node,7);
T1.RightInsert(node,17);
T1.leftInsert(node.Left,8);
T1.RightInsert(node.Left,9);
T1.leftInsert(node.Right,15);
T1.RightInsert(node.Right,12);
T1.inOrderTraversal(node);
System.out.println();
T1.preOrderTraversal(node);
System.out.println();
T1.postOrderTraversal(node);
}
}
}