-
Notifications
You must be signed in to change notification settings - Fork 0
/
BottomViewOfBinaryTree.java
56 lines (44 loc) · 1.42 KB
/
BottomViewOfBinaryTree.java
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
/*********************************************
class BinaryTreeNode {
int val;
BinaryTreeNode left;
BinaryTreeNode right;
BinaryTreeNode(int val) {
this.val = val;
this.left = null;
this.right = null;
}
}
*********************************************/
import java.util.*;
public class Solution {
public static ArrayList<Integer> bottomView(BinaryTreeNode root) {
ArrayList<Integer> result = new ArrayList<>();
Queue<Pair> queue = new LinkedList<>();
Map<Integer,Integer> map = new TreeMap<>();
if(root==null)
return result;
Pair rt = new Pair(root,0);
queue.offer(rt);
while(!queue.isEmpty()){
Pair temp = queue.poll();
map.put(temp.index,temp.node.val);
if(temp.node.left!=null)
queue.offer(new Pair(temp.node.left,temp.index-1));
if(temp.node.right!=null)
queue.offer(new Pair(temp.node.right,temp.index+1));
}
for(Map.Entry<Integer,Integer> entry : map.entrySet()){
result.add(entry.getValue());
}
return result;
}
}
class Pair{
BinaryTreeNode node;
int index;
Pair(BinaryTreeNode node,int i){
this.node = node;
index= i;
}
}