-
Notifications
You must be signed in to change notification settings - Fork 15
Expand file tree
/
Copy pathBT_Problem_10.java
More file actions
51 lines (39 loc) · 1.08 KB
/
Copy pathBT_Problem_10.java
File metadata and controls
51 lines (39 loc) · 1.08 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
package trees.binaryTree;
/* Problem Title :- Write a Java program to find Right View of Tree.
*
* Right View of a tree :-
* The right view of a binary tree, is set of nodes visible when tree is visited from rights side
* between two end nodes.
*/
class Max_level{
int max_level;
}
public class BT_Problem_10 {
Node root;
Max_level max_level = new Max_level();
void rightViewUtil(Node node, int level, Max_level max_level) {
if(node == null)
return;
if(max_level.max_level < level) {
System.out.print(node.data + " " );
max_level.max_level = level;
}
rightViewUtil(node.right, level+1,max_level);
rightViewUtil(node.left, level+1,max_level);
}
void rightView() {
rightView(root);
}
void rightView(Node node) {
rightViewUtil(node, 1, max_level);
}
public static void main(String[] args) {
BT_Problem_10 tree = new BT_Problem_10();
tree.root = new Node(12);
tree.root.left = new Node(10);
tree.root.right = new Node(30);
tree.root.right.left = new Node(25);
tree.root.right.right = new Node(40);
tree.rightView();
}
}