涉及题目
199. 二叉树的右视图
199. 二叉树的右视图
一开始的错误想法,代码:
/**
* 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> resList = new ArrayList<>();
if (root == null) {
return resList;
}
resList.add(root.val);
TreeNode node = root.right;
while (node != null) {
resList.add(node.val);
node = node.right;
}
return resList;
}
}
思路错误原因:
在resList中保存的是根节点的右节点的右节点的右节点……
但是,题目要求的是站在二叉树的右侧,所能看到的节点值
如果第二层只有一个节点,而且其是二叉树的左节点,也满足题目的要求,但是上面的代码无法满足条件
解决思路:
遍历每一层的最后一个节点,代码:
/**
* 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> resList = new ArrayList<>();
if (root == null) {
return resList;
}
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while (!queue.isEmpty()) {
int len = queue.size();
for (int i = 0;i < len;i++) {
TreeNode node = queue.poll();
if (node.left != null) {
queue.offer(node.left);
}
if (node.right != null) {
queue.offer(node.right);
}
if (i == len - 1) {
resList.add(node.val);
}
}
}
return resList;
}
}