[和小菜鸡一起刷题(python)] LeetCode 199. 二叉树的右视图. (Binary Tree Right Side View)
2019-03-22 11:26
796 查看
LeetCode 199. 二叉树的右视图(Binary Tree Right Side View)
原题
给定一棵二叉树,想象自己站在它的右侧,按照从顶部到底部的顺序,返回从右侧所能看到的节点值。
示例:
输入: [1,2,3,null,5,null,4]
输出: [1, 3, 4]
解释:
1 <--- / \ 2 3 <--- \ \ 5 4 <---
思路
二叉树层序遍历,输出每层最后一个元素。
代码
# 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 = [] p1 = [root] while p1: res.append(p1[-1].val) p = [] for node in p1: if node.left: p.append(node.left) if node.right: p.append(node.right) p1 = p return res
相关文章推荐
- Leetcode 199 Binary Tree Right Side View 二叉树右视图
- Leetcode 199 Binary Tree Right Side View 二叉树右视图
- LeetCode 199 Binary Tree Right Side View(二叉树层序遍历)
- 199. Binary Tree Right Side View Leetcode Python
- 199.leetcode Binary Tree Right Side View(medium)[层次遍历二叉树 队列]
- 【LeetCode-面试算法经典-Java实现】【199-Binary Tree Right Side View(从右边看二叉树)】
- [LeetCode] Binary Tree Right Side View 二叉树的右侧视图
- 【LeetCode-面试算法经典-Java实现】【199-Binary Tree Right Side View(从右边看二叉树)】
- 【LEETCODE】199-Binary Tree Right Side View
- leetCode 101/199-Symmetric Tree/Binary Tree Right Side View
- leetcode-199 Binary Tree Right Side View
- Leetcode 199 Binary Tree Right Side View
- [LeetCode 199] Binary Tree Right Side View (递归的层数)
- [leetcode 199]Binary Tree Right Side View
- LeetCode 199 Binary Tree Right Side View
- 【小熊刷题】Binary Tree Right Side View <Leetcode 199, Java>
- LeetCode - 199 - Binary Tree Right Side View
- Leetcode 199: Binary Tree Right Side View
- LeetCode—Binary Tree Right Side View 二叉树层序遍历变形,Flatten Binary Tree to Linked List前序遍历变形
- leetcode 199: Binary Tree Right Side View