二叉树的右视图 python_【leetcode刷题】T128-二叉树的右视图

二叉树类型第18篇解题报告

leetcode第199题：二叉树的右视图

https://leetcode-cn.com/problems/binary-tree-right-side-view/

【题目】

给定一棵二叉树，想象自己站在它的右侧，按照从顶部到底部的顺序，返回从右侧所能看到的节点值。示例:

输入: [1,2,3,null,5,null,4]

输出: [1, 3, 4]

解释:

1

/ \

2 3

\ \

5 4

【思路】

使用层次遍历，只保留每一层最后一个元素。

【代码】

python版本# Definition for a binary tree node.

# class TreeNode(object):

# def __init__(self, x):

# self.val = x

# self.left = None

# self.right = None

class Solution(object):

def rightSideView(self, root):

"""

:type root: TreeNode

:rtype: List[int]

"""

if not root:

return []

res = [0]

p = [root]

q = []

while len(p) != 0 or len(q) != 0:

if len(p) == 0:

p = q

q = []

res.append(0)

tmp = p.pop(0)

res[-1] = tmp.val

if tmp.left:

q.append(tmp.left)

if tmp.right:

q.append(tmp.right)

return res

C++版本/**

* Definition for a binary tree node.

* struct TreeNode {

* int val;

* TreeNode *left;

* TreeNode *right;

* TreeNode(int x) : val(x), left(NULL), right(NULL) {}

* };

*/

class Solution {

public:

vector rightSideView(TreeNode* root) {

vector res;

if(!root)

return res;

res.push_back(0);

queue p;

queue q;

p.push(root);

while(p.size() != 0 || q.size() != 0){

if(p.size() == 0){

while(q.size() != 0){

p.push(q.front());

q.pop();

}

res.push_back(0);

}

TreeNode* tmp = p.front();

p.pop();

res[res.size()-1] = tmp->val;

if(tmp->left)

q.push(tmp->left);

if(tmp->right)

q.push(tmp->right);

}

return res;

}

};