二叉树的右视图(剑指Offer II 046)
给定一个二叉树的 根节点 root,想象自己站在它的右侧,按照从顶部到底部的顺序,返回从右侧所能看到的节点值。
输入: [1,2,3,null,5,null,4]
输出: [1,3,4]
思路:右视图即为二叉树每层最后一个节点
class Solution {
public List<Integer> rightSideView(TreeNode root) {
List<Integer> result = new LinkedList<>();
Queue<TreeNode> queue1 = new LinkedList<>();
Queue<TreeNode> queue2 = new LinkedList<>();
if(root != null){
queue1.offer(root);
}
while(!queue1.isEmpty()){
TreeNode node = queue1.poll();
if(node.left != null){
queue2.offer(node.left);
}
if(node.right != null){
queue2.offer(node.right);
}
if(queue1.isEmpty()){
result.add(node.val);
queue1 = queue2;
queue2 = new LinkedList<>();
}
}
return result;
}
}
变型:求二叉树左视图,即为二叉树每层第一个节点。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> rightSideView(TreeNode root) {
List<Integer> result = new LinkedList<>();
Queue<TreeNode> queue1 = new LinkedList<>();
Queue<TreeNode> queue2 = new LinkedList<>();
if(root != null){
queue1.offer(root);
}
result.add(root.val);
while(!queue1.isEmpty()){
TreeNode node = queue1.poll();
if(node.left != null){
queue2.offer(node.left);
}
if(node.right != null){
queue2.offer(node.right);
}
if(queue1.isEmpty()){
queue1 = queue2;
queue2 = new LinkedList<>();
if(!queue1.isEmpty()){
result.add(queue1.peek().val);
}
}
}
return result;
}
}