InterviewCodeProgramExamples/KWBinaryTreeExample.java at main · dknitk/InterviewCodeProgramExamples · 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
packagecom.codinginterview;

publicclassKWBinaryTreeExample {

publicstaticvoidmain(String[] args) {
System.out.println("Binary Tree Example!");
TreeTraversalt1 = newTreeTraversal();
t1.root = newNode('A');
t1.root.left = newNode('B');
t1.root.right = newNode('C');
t1.root.left.left = newNode('D');
t1.root.left.right = newNode('E');

// Call method
System.out.println("Pre Order Traversal");
t1.prePorderTraversal(t1.root);
System.out.println("\nIn Order Traversal");
t1.inOrderTraversal(t1.root);
System.out.println("\nPost Order Traversal");
t1.postOrderTraversal(t1.root);

 }


}
classNode{
charkey;
Nodeleft;
Noderight;
Node(charkey){
this.key = key;
 }
}

classTreeTraversal{
Noderoot;

voidprePorderTraversal(Noden){
if(n != null){
System.out.print(n.key + " ");
prePorderTraversal(n.left);
prePorderTraversal(n.right);
 }
 }
voidpostOrderTraversal(Noden){
if(n != null){
postOrderTraversal(n.left);
postOrderTraversal(n.right);
System.out.print(n.key + " ");
 }
 }
voidinOrderTraversal(Noden){
if(n != null){
inOrderTraversal(n.left);
System.out.print(n.key + " ");
inOrderTraversal(n.right);
 }
 }
}