forked from joharbatta/DataStructure-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrightView.java
More file actions
89 lines (80 loc) · 1.72 KB
/
Copy pathrightView.java
File metadata and controls
89 lines (80 loc) · 1.72 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
86
87
88
89
import java.util.LinkedList;
import java.util.Queue;
class Node
{
int data;
Node left;
Node right;
Node(int data)
{
this.data=data;
left=right=null;
}
}
class BinaryTree{
Node root;
BinaryTree()
{
root = null;
}
BinaryTree(int data)
{
this.root=new Node(data);
}
int levelPrint=1;
void rightView(Node root,int level)
{
if(root==null)
return;
if(level==levelPrint)
{
System.out.print(root.data+" ");
levelPrint++;
}
rightView(root.right,level+1);
rightView(root.left,level+1);
}
//iterative
void rightView1(Node root)
{
if(root==null)
return;
Queue<Node> q=new LinkedList<>();
q.add(root);
while(true)
{
int size=q.size();
if(size==0)
{
break;
}
for(int i=0;i<size;i++)
{
Node temp=q.remove();
if(i==size-1)
{
System.out.print(temp.data+" ");
}
if(temp.left!=null)
{
q.add(temp.left);
}
if(temp.right!=null)
{
q.add(temp.right);
}
}
}
}
}
class rightView{
public static void main(String[] args) {
BinaryTree bt=new BinaryTree(2);
bt.root.left=new Node(3);
bt.root.right=new Node(5);
bt.root.left.right=new Node(9);
bt.root.right.left=new Node(7);
bt.rightView(bt.root,1);
bt.rightView1(bt.root);
}
}