# 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]
"""
return self.recursion(root,[],1)
def recursion(self,root,result,depth):
if not root:
return result
if depth>len(result):
result.append(root.val)
self.recursion(root.right,result,depth+1)
self.recursion(root.left,result,depth+1)
return result
199. Binary Tree Right Side View
最后编辑于 :
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门,熙熙楼的掌柜王于贵愁眉苦脸地迎上来,“玉大人,你说我怎么就摊上这事。” “怎么了?”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着,像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上,一...
- 文/苍兰香墨 我猛地睁开眼,长吁一口气:“原来是场噩梦啊……” “哼!你这毒妇竟也来了?” 一声冷哼从身侧响起,我...
推荐阅读更多精彩内容
- Given a binary tree, imagine yourself standing on the rig...
- Given a binary tree, imagine yourself standing on the rig...
- 题目199. Binary Tree Right Side View Given a binary tree, i...
- 类似level order,只是保存每层的最后一个节点:if(i == size-1){ret = realloc...
- Binary Tree Right Side View Given a binary tree, imagine ...