-
Notifications
You must be signed in to change notification settings - Fork 15
Expand file tree
/
Copy pathBT_Problem_06_b.java
More file actions
48 lines (34 loc) · 998 Bytes
/
Copy pathBT_Problem_06_b.java
File metadata and controls
48 lines (34 loc) · 998 Bytes
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
package trees.binaryTree;
/*
* Problem Title :- In-order Traversal of a tree using Recursion
*/
public class BT_Problem_06_b {
Node root;
// Constructor
BT_Problem_06_b(){
root = null;
}
//Given a binary tree, print its nodes in in-order
void printInorder(Node node) {
if(node == null) return;
/* first recur on left child */
printInorder(node.left);
/* then print data of node */
System.out.print(node.data + " ");
/* now recur on right child */
printInorder(node.right);
}
// Wrappers over above recursive function
void printInorder() { printInorder(root); }
// Driver method
public static void main(String[] args) {
BT_Problem_06_b tree = new BT_Problem_06_b();
tree.root = new Node(1);
tree.root.left = new Node(2);
tree.root.right = new Node(3);
tree.root.left.left = new Node(4);
tree.root.left.right = new Node(5);
System.out.println("\nInorder traversal of binary tree is ");
tree.printInorder();
}
}