-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSimple_TreeTraversal.java
More file actions
73 lines (63 loc) · 1.43 KB
/
Copy pathSimple_TreeTraversal.java
File metadata and controls
73 lines (63 loc) · 1.43 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
//Implementation of simple Inorder, Preorder and Postorder in java.
class Node{
int key;
Node left, right;
Node(int item){
key = item;
left = right = null;
}
}
class Simple_TreeTraversal {
Node root;
Simple_TreeTraversal(){
root = null;
}
void printPostorder(Node node){
if(node == null){
return;
}
printPostorder(node.left);
printPostorder(node.right);
System.out.print(node.key+ " ");
}
void printInorder(Node node){
if(node == null){
return;
}
printInorder(node.left);
System.out.print(node.key+ " ");
printInorder(node.right);
}
void printPreorder(Node node){
if(node == null){
return;
}
System.out.print(node.key+ " ");
printPreorder(node.left);
printPreorder(node.right);
}
void printPostorder(){
printPostorder(root);
}
void printPreorder(){
printPreorder(root);
}
void printInorder(){
printInorder(root);
}
public static void main(String[] args) {
// TODO Auto-generated method stub
Simple_TreeTraversal tt = new Simple_TreeTraversal();
tt.root = new Node(1);
tt.root.left = new Node(2);
tt.root.right = new Node(3);
tt.root.left.left = new Node(4);
tt.root.left.right = new Node(5);
System.out.println("Preorder traversal of binary tree is: ");
tt.printPreorder();
System.out.println("\nInorder traversal of binary tree is: ");
tt.printInorder();
System.out.println("\nPostorder traversal of binary tree is: ");
tt.printPostorder();
}
}