2019年2月12日
[leetcode] Vertical Order Traversal of a Binary Tree
摘要： 1. Traverse the binary tree, store {x,y,val} for every node in records; 2. Sort the records of {x,y,val} for all nodes by increasing x, decreasing y, 阅读全文
posted @ 2019-02-12 20:29 丹尼尔奥利瓦 阅读(230) 评论(0) 推荐(0) 编辑