forked from avinashbest/java-coding-ninjas
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTreeTraversal.java
More file actions
85 lines (71 loc) · 2.69 KB
/
TreeTraversal.java
File metadata and controls
85 lines (71 loc) · 2.69 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
package binaryTrees1;
import static binaryTrees1.BinaryTreeInput.takeTreeInputDetailed;
import static binaryTrees1.BinaryTreeInput.printBinaryTree;
/*Preorder Binary Tree
For a given Binary Tree of integers, print the pre-order traversal.
Input Format:
The first and the only line of input will contain the nodes data, all separated by a single space. Since -1 is used as an indication whether the left or right node data exist for root, it will not be a part of the node data.
Output Format:
The only line of output prints the pre-order traversal of the given binary tree.
Constraints:
1 <= N <= 10^6
Where N is the total number of nodes in the binary tree.
Time Limit: 1 sec
Sample Input 1:
5 6 10 2 3 -1 -1 -1 -1 -1 9 -1 -1
Sample Ouptut 1:
5 6 2 3 9 10
Sample Input 2:
1 2 3 4 5 6 7 -1 -1 -1 -1 -1 -1 -1 -1
Sample Ouptut 2:
1 2 4 5 3 6 7 */
/*Postorder Binary Tree
For a given Binary Tree of integers, print the post-order traversal.
Input Format:
The first and the only line of input will contain the node data, all separated by a single space. Since -1 is used as an indication whether the left or right node data exist for root, it will not be a part of the node data.
Output Format:
The only line of output prints the post-order traversal of the given binary tree.
Constraints:
1 <= N <= 10^6
Where N is the total number of nodes in the binary tree.
Time Limit: 1 sec
Sample Input 1:
1 2 3 4 5 6 7 -1 -1 -1 -1 -1 -1 -1 -1
Sample Output 1:
4 5 2 6 7 3 1
Sample Input 2:
5 6 10 2 3 -1 -1 -1 -1 -1 9 -1 -1
Sample Output 1:
2 9 3 6 10 5
*/
public class TreeTraversal {
public static void preorderTraversal(BinaryTreeNode<Integer> root) {
if (root == null) return;
System.out.print(root.data + " ");
preorderTraversal(root.left);
preorderTraversal(root.right);
}
public static void inorderTraversal(BinaryTreeNode<Integer> root) {
if (root == null) return;
inorderTraversal(root.left);
System.out.print(root.data + " ");
inorderTraversal(root.right);
}
public static void postorderTraversal(BinaryTreeNode<Integer> root) {
if (root == null) return;
postorderTraversal(root.left);
postorderTraversal(root.right);
System.out.print(root.data + " ");
}
public static void main(String[] args) {
var root = takeTreeInputDetailed(true, 0, true);
System.out.println("----------The Tree is----------");
printBinaryTree(root);
System.out.println("Preorder Traversal: ");
preorderTraversal(root);
System.out.println("\nInorder Traversal: ");
inorderTraversal(root);
System.out.println("\nPostorder Traversal: ");
postorderTraversal(root);
}
}