问题:
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]
.
解决:
① 层序遍历找到最右边的节点存储即可。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution{//2ms
public List<Integer> rightSideView(TreeNode root){
List<Integer> res = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList<>();
if(root == null) return res;//必须添加,否则会出现空指针异常
queue.offer(root);
while(! queue.isEmpty()){
int count = queue.size();
for (int i = 0;i < count ;i ++ ) {
TreeNode tmp = queue.poll();
if (tmp.left != null) {
queue.offer(tmp.left);
}
if (tmp.right != null) {
queue.offer(tmp.right);
}
if (i == count - 1) {
res.add(tmp.val);
}
}
}
return res;
}
}
② 用DFS先遍历右子树并记录遍历的深度,如果这个右子节点的深度大于当前所记录的最大深度,说明它是下一层的最右节点(因为我们先遍历右边,所以每一层都是先从最右边进入),将其加入结果中。
class Solution {//1ms
List<Integer> res = new ArrayList<>();
int maxDepth = 0;//该参数不能放到方法里面,因为只需要从上到下遍历一次即可,不需要返回。
public List<Integer> rightSideView(TreeNode root) {
if (root != null) {
dfs(root,1);
}
return res;
}
public void dfs(TreeNode root,int depth){
if (depth > maxDepth) {
maxDepth = depth;
res.add(root.val);
}
if(root.right != null) dfs(root.right,depth + 1);
if(root.left != null) dfs(root.left,depth + 1);
}
}
③ 也是dfs,不过递归判断条件有一点不同。
class Solution {
public List<Integer> rightSideView(TreeNode root) {
List<Integer> res = new ArrayList<Integer>();
dfs(root, res, 0);
return res;
}
private void dfs(TreeNode cur, List<Integer> res, int curDepth){
if(cur == null) return;
if(curDepth == res.size()) res.add(cur.val);
dfs(cur.right, res, curDepth + 1);
dfs(cur.left, res, curDepth + 1);
}
}