LeetCode987

Solution

思路：通过一个二维的字典存储树的col和row，最后排序，遍历即可：

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution(object):
    def verticalTraversal(self, root):
        """
        :type root: TreeNode
        :rtype: List[List[int]]
        """
        # 使用二维字典保存至，字典的key为坐标（列号，行号）
        dicts = defaultdict(dict)
        
        def find(node,row,col):
            if node==None:
                return
            val = node.val
            if row not in dicts[col]:
                dicts[col][row] =[]
            dicts[col][row].append(val)
            find(node.left,row+1,col-1)
            find(node.right,row+1,col+1)
        find(root,0,0)   
        
        res=[]
        for col in sorted(dicts):
            temp =[]
            for row in sorted(dicts[col]):
                temp+=sorted(dicts[col][row])
            res.append(temp) 
        
        return res