文章目录

1. 1. Binary Tree Right Side View

Binary Tree Right Side View

---

给定一个二叉树，从右边观察这棵树，从上至下返回数值的序列

比如一棵树是[1,2,3,NULL,5,NULL,4]，那么返回[1,3,4]