题目描述
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
For example:
Given the following binary tree,
1 <---
/ \
2 3 <---
\ \
5 4 <---
You should return [1, 3, 4].
Credits:
Special thanks to @amrsaqr for adding this problem and creating all test cases.
分析
可以参考LeetCode 102 Binary Tree Level Order Traversal
1. 递归求解
二叉树,从右边向左边看。那么除了最右边的一个list1,还会有一个相对于最右边的list稍微靠左边一点的list2,如果list2比list1长,则list2较长的部分也是结果。
举个例子:
1 <---
/ \
2 3 <---
\ \
5 4 <---
\
6 <---
list1是[1, 3, 4], list2是[1, 2, 5, 6]。list2比list1长,长出的部分是6,也在结果之中。
2. 插入特殊结点
通过插入特殊结点,来判断一层是否结束。这样做的好处是不用统计每一层结点数目。
3. 计数法
定义两个变量,toBePrinted和nextLevel。
toBePrinted:当前待打印结点的数量
nextLevel:下一层的结点数量
通过Deque来进行统计。
代码
代码1:递归求解
public static List<Integer> rightSideView(TreeNode root) {
List<Integer> rt = new ArrayList<Integer>();
if (root == null) {
return rt;
}
rt.add(root.val);
List<Integer> left = rightSideView(root.left);
List<Integer> right = rightSideView(root.right);
rt.addAll(right);
if (left.size() > right.size()) {
rt.addAll(left.subList(right.size(), left.size()));
}
return rt;
}
代码2:插入特殊结点
public static List<Integer> rightSideView2(TreeNode root) {
List<Integer> rt = new ArrayList<Integer>();
if (root == null) {
return rt;
}
final TreeNode END = new TreeNode(0);
Deque<TreeNode> deque = new LinkedList<TreeNode>();
deque.add(root);
deque.add(END);
while (!deque.isEmpty()) {
TreeNode p = deque.pop();
if (p == END) {
if (!deque.isEmpty()) {
deque.add(END);
}
} else {
// 如果deque的下一个是END,则p是层序的最后一个,加入结果rt
if (deque.peek() == END) {
rt.add(p.val);
}
if (p.left != null) {
deque.add(p.left);
}
if (p.right != null) {
deque.add(p.right);
}
}
}
return rt;
}
代码3:计数法
public static List<Integer> rightSideView3(TreeNode root) {
List<Integer> rt = new ArrayList<Integer>();
if (root == null) {
return rt;
}
Deque<TreeNode> deque = new LinkedList<TreeNode>();
deque.add(root);
int toBePrinted = 1;
int nextLevel = 0;
List<Integer> level = new LinkedList<Integer>();
while (!deque.isEmpty()) {
TreeNode p = deque.poll();
level.add(p.val);
toBePrinted--;
if (p.left != null) {
deque.addLast(p.left);
nextLevel++;
}
if (p.right != null) {
deque.addLast(p.right);
nextLevel++;
}
if (toBePrinted == 0) {
toBePrinted = nextLevel;
nextLevel = 0;
rt.add(p.val);
level.clear();
}
}
return rt;
}