Problem:
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.
Explanation:
得到树的右视图。
My Thinking:
层序遍历,将每层的最右结点加入list即可。
My Solution:
class Solution {
public List<Integer> rightSideView(TreeNode root) {
List<Integer> list=new ArrayList<>();
Queue<TreeNode> queue=new LinkedList<>();
if(root==null)
return new ArrayList<>();
queue.add(root);
while(!queue.isEmpty()){
int length=queue.size();
for(int i=0;i<length;i++){
TreeNode node=queue.poll();
if(i==length-1){//如果是该行最后一个元素
list.add(node.val);
}
if(node.left!=null)
queue.add(node.left);
if(node.right!=null)
queue.add(node.right);
}
}
return list;
}
}
Optimum Thinking:
使用递归,维护一个深度变量depth,先递归右孩子,再递归左孩子,如果当前结点的深度=list.size-1,那么就将其加入队列。
Optimum Solution:
class Solution {
public List<Integer> rightSideView(TreeNode root) {
List<Integer> result = new ArrayList<Integer>();
rightView(root, result, 0);
return result;
}
public void rightView(TreeNode curr, List<Integer> result, int currDepth){
if(curr == null){
return;
}
if(currDepth == result.size()){
result.add(curr.val);
}
rightView(curr.right, result, currDepth + 1);
rightView(curr.left, result, currDepth + 1);
}
}