Question: https://leetcode.com/problems/binary-tree-right-side-view/
Question Name: Binary Tree Right Side View
A variant of level order tree traversal.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 | # Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: # @param {TreeNode} root # @return {integer[]} def rightSideView(self, root): current_layer = [root] if root != None else [] result = [] while len(current_layer) != 0: result.append(current_layer[-1].val) next_layer = [] for node in current_layer: if node.left != None: next_layer.append(node.left) if node.right != None: next_layer.append(node.right) current_layer = next_layer return result |