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.
Given the following binary tree,
2 3 <---
5 4 <---
You should return
[1, 3, 4].
Special thanks to @amrsaqr for adding this problem and creating all test cases.