LeetCode - Binary Tree Right Side View
摘要：
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Example: Input: [1,2,3,null,5,null,4] Output: [1, 3, 4... 阅读全文
posted @ 2018-10-16 05:21 IncredibleThings 阅读(82) 评论(0) 推荐(0) 编辑