Repository navigation
Expand file tree
/
Copy pathBinaryTreeLeftView.java
More file actions
85 lines (65 loc) · 2.06 KB
/
Copy pathBinaryTreeLeftView.java
File metadata and controls
85 lines (65 loc) · 2.06 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 com.abn.dsalgos.datastructure.binaryTree;
import com.abn.dsalgos.utils.MyTreeNode;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
public class BinaryTreeLeftView<T> {
public MyTreeNode<T> root;
int nodeCount;
public BinaryTreeLeftView() {
root = null;
}
public List<Integer> leftView(MyTreeNode<T> node) {
Queue<MyTreeNode<T>> queue = new LinkedList<>();
List<Integer> leftViewResult = new ArrayList<>();
if (node == null) {
return leftViewResult;
}
queue.add(node);
while (!queue.isEmpty()) {
int i = 1;
nodeCount = queue.size();
while (i <= nodeCount) {
MyTreeNode<T> current = queue.poll();
if (i == 1) {
leftViewResult.add((Integer) current.data);
}
if (current.left != null) {
queue.add(current.left);
}
if (current.right != null) {
queue.add(current.right);
}
i++;
}
}
return leftViewResult;
}
public List<Integer> rightView(MyTreeNode<T> node) {
Queue<MyTreeNode<T>> queue = new LinkedList<>();
List<Integer> rightViewResult = new ArrayList<>();
if (node == null) {
return rightViewResult;
}
queue.add(node);
while (!queue.isEmpty()) {
int i = 1;
nodeCount = queue.size();
while (i <= nodeCount) {
MyTreeNode<T> current = queue.poll();
if (i == nodeCount) {
rightViewResult.add((Integer) current.data);
}
if (current.left != null) {
queue.add(current.left);
}
if (current.right != null) {
queue.add(current.right);
}
i++;
}
}
return rightViewResult;
}
}