从右边看二叉树

一个二叉树，从右边看，输出你看到的从上到下的顺序

 

其实就是遍历每一层

#!/usr/bin/env python
# -*- coding:utf-8 -*-
# Power by WenBin  2017-02-23 20:49:59


For example:
Given the following binary tree,
   1            <---
 /   \
2     3         <---
 \     \
  5     4       <---
You should return [1, 3, 4].


class TreeNode:
    def __init__(self, x): 
        self.val = x 
        self.left = None
        self.right = None

class Solution(object):
    def findright(self, root, level, re):
        if root is not None:
            if len(re) == level:
                re.append(root.val)
            self.levelorder(root.right, level+1, re) 
            self.levelorder(root.left, level+1, re) 
    def rightSideView(self, root):
        """ 
        :type root: TreeNode
        :rtype: List[int]
        """
        re = []
        self.findright(root, 0, re) 
        return re